Javascript must be enabled to continue!
Cayley subspace sum graph of vector spaces
View through CrossRef
Let $\mathbb{V}$ be a finite dimensional vector space over the field $\mathbb{F}$. Let $S(\mathbb{V})$ be the set of all subspaces of $\mathbb{V}$ and $\mathbb{A}\subseteq S^*(\mathbb{V})=S(\mathbb{V})\backslash\{0\}.$ In this paper, we define the Cayley subspace sum graph of $\mathbb{V},$ denoted by Cay$(S^*(\mathbb{V}),\mathbb{A}), $ as the simple undirected graph with vertex set $S^*(\mathbb{V})$ and two distinct vertices $X$ and $Y$ are adjacent if $X+Z=Y$ or $Y+Z=X$ for some $Z\in \mathbb{A}$. Having defined the Cayley subspace sum graph, we study about the connectedness, diameter and girth of several classes of Cayley subspace sum graphs Cay$(S^*(\mathbb{V}), \mathbb{A})$ for a finite dimensional vector space $\mathbb{V}$ and $\mathbb{A}\subseteq S^*(\mathbb{V})=S(\mathbb{V})\backslash\{0\}.$
The International Electronic Journal of Algebra
Title: Cayley subspace sum graph of vector spaces
Description:
Let $\mathbb{V}$ be a finite dimensional vector space over the field $\mathbb{F}$.
Let $S(\mathbb{V})$ be the set of all subspaces of $\mathbb{V}$ and $\mathbb{A}\subseteq S^*(\mathbb{V})=S(\mathbb{V})\backslash\{0\}.
$ In this paper, we define the Cayley subspace sum graph of $\mathbb{V},$ denoted by Cay$(S^*(\mathbb{V}),\mathbb{A}), $ as the simple undirected graph with vertex set $S^*(\mathbb{V})$ and two distinct vertices $X$ and $Y$ are adjacent if $X+Z=Y$ or $Y+Z=X$ for some $Z\in \mathbb{A}$.
Having defined the Cayley subspace sum graph, we study about the connectedness, diameter and girth of several classes of Cayley subspace sum graphs Cay$(S^*(\mathbb{V}), \mathbb{A})$ for a finite dimensional vector space $\mathbb{V}$ and $\mathbb{A}\subseteq S^*(\mathbb{V})=S(\mathbb{V})\backslash\{0\}.
$.
Related Results
On isomorphisms of m-Cayley digraphs
On isomorphisms of m-Cayley digraphs
The isomorphism problem for digraphs is a fundamental problem in graph theory. This problem for Cayley digraphs has been extensively investigated over the last half a century. In t...
A Touch of Space Weather - Outreach project for visually impaired students
A Touch of Space Weather - Outreach project for visually impaired students
<p><em><span data-preserver-spaces="true">'A Touch of Space Weather' is a project that brings space weather science into...
The Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism Property for Cayley Maps
The Cayley Isomorphism property for combinatorial objects was introduced by L. Babai in 1977. Since then it has been intensively studied for binary relational structures: graphs, d...
Power Cayley Graphs of Dihedral Groups with Certain Order
Power Cayley Graphs of Dihedral Groups with Certain Order
Combination of the concepts of power graph and Cayley graph associated to groups has led to the introduction to two new variations of Cayley graph known as the union power Cayley g...
Finite edge-transitive Cayley graphs and rotary Cayley maps
Finite edge-transitive Cayley graphs and rotary Cayley maps
This paper aims to develop a theory for studying Cayley graphs, especially for those with a high degree of symmetry. The theory consists of analysing several types of basic Cayley ...
On Subspace-recurrent Operators
On Subspace-recurrent Operators
In this article, subspace-recurrent operators are presented and it is showed that the set of subspace-transitive operators is a strict subset of the set of subspace-recurrent opera...
Graph convolutional neural networks for 3D data analysis
Graph convolutional neural networks for 3D data analysis
(English) Deep Learning allows the extraction of complex features directly from raw input data, eliminating the need for hand-crafted features from the classical Machine Learning p...
Cayley graphs and cayley Signed graphs over finite commutative rings
Cayley graphs and cayley Signed graphs over finite commutative rings
Let R be a finite commutative ring with identity1≠0. The unitary Cayley graph of R, denoted by Gr, is the graph whose vertex set is R and the edge set {{a,b} : a,bϵR and a-bϵR ˟ },...

