نتایج جستجو برای: integral cayley graph
تعداد نتایج: 312504 فیلتر نتایج به سال:
darafsheh and assari in [normal edge-transitive cayley graphs onnon-abelian groups of order 4p, where p is a prime number, sci. china math. {bf 56} (1) (2013) 213$-$219.] classified the connected normal edge transitive and $frac{1}{2}-$arc-transitive cayley graph of groups of order$4p$. in this paper we continue this work by classifying theconnected cayley graph of groups of order $2pq$, $p > q...
The distance energy of a graph G is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of G. There was a vast research for the pairs and families of non-cospectral graphs having equal distance energy, and most of these constructions were based on the join of graphs. A graph is called circulant if it is Cayley graph on the ...
a graph $gamma$ is said to be vertex-transitive or edge- transitive if the automorphism group of $gamma$ acts transitively on $v(gamma)$ or $e(gamma)$, respectively. let $gamma=cay(g,s)$ be a cayley graph on $g$ relative to $s$. then, $gamma$ is said to be normal edge-transitive, if $n_{aut(gamma)}(g)$ acts transitively on edges. in this paper, the eigenvalues of normal edge-tra...
In this work, the eigenspaces of unitary Cayley graphs and certain Hamming graphs are considered. It is shown that these graph classes are closely related and admit particularly simple eigenspace bases for all eigenvalues, namely bases containing vectors only with entries from the set {0, 1,−1}. A direct consequence is that the considered graph classes are integral.
A mixed graph is said to be second kind hermitian integral (HS-integral) if the eigenvalues of its Hermitian-adjacency matrix are integers. called Eisenstein (0, 1)-adjacency We characterize set S for which normal Cayley Cay(Γ,S) HS-integral any finite group Γ. further show that a and only it integral. This paper generalizes results Kadyan Bhattacharjy (2022) [11].
Let G(V;E) be a graph. The common neighborhood graph (congraph) of G is a graph with vertex set V , in which two vertices are adjacent if and only if they have a common neighbor in G. In this paper, we obtain characteristics of congraphs under graph operations; Graph :::::union:::::, Graph cartesian product, Graph tensor product, and Graph join, and relations between Cayley graphs and its c...
Abstract : We call a Cayley graph Γ = Cay (G, S) normal for G, if the right regular representation R(G) of G is normal in the full automorphism group of Aut(Γ). In this paper, a classification of all non-normal Cayley graphs of finite abelian group with valency 6 was presented.
The WL-rank of a graph Γ is defined to be the rank coherent configuration Γ. We construct new infinite family strictly Deza Cayley graphs for which equal number vertices. from this are divisible design and integral.
darafsheh and assari in [normal edge-transitive cayley graphs on non-abelian groups of order 4p, where $p$ is a prime number, sci. china math., 56 (1) (2013) 213-219.] classified the connected normal edge transitive and $frac{1}{2}-$arc-transitive cayley graph of groups of order $4p$. in this paper we continue this work by classifying the connected cayley graph of groups of order...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید