COMPUTING THE EIGENVALUES OF CAYLEY GRAPHS OF ORDER p2q
Authors
Abstract:
A graph is called symmetric if its full automorphism group acts transitively on the set of arcs. The Cayley graph $Gamma=Cay(G,S)$ on group $G$ is said to be normal symmetric if $N_A(R(G))=R(G)rtimes Aut(G,S)$ acts transitively on the set of arcs of $Gamma$. In this paper, we classify all connected tetravalent normal symmetric Cayley graphs of order $p^2q$ where $p>q$ are prime numbers.
similar resources
On the distance eigenvalues of Cayley graphs
In this paper, we determine the distance matrix and its characteristic polynomial of a Cayley graph over a group G in terms of irreducible representations of G. We give exact formulas for n-prisms, hexagonal torus network and cubic Cayley graphs over abelian groups. We construct an innite family of distance integral Cayley graphs. Also we prove that a nite abelian group G admits a connected...
full textOn the eigenvalues of normal edge-transitive Cayley graphs
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...
full textOn the eigenvalues of Cayley graphs on generalized dihedral groups
Let $Gamma$ be a graph with adjacency eigenvalues $lambda_1leqlambda_2leqldotsleqlambda_n$. Then the energy of $Gamma$, a concept defined in 1978 by Gutman, is defined as $mathcal{E}(G)=sum_{i=1}^n|lambda_i|$. Also the Estrada index of $Gamma$, which is defined in 2000 by Ernesto Estrada, is defined as $EE(Gamma)=sum_{i=1}^ne^{lambda_i}$. In this paper, we compute the eigen...
full textComputing Wiener and hyper–Wiener indices of unitary Cayley graphs
The unitary Cayley graph Xn has vertex set Zn = {0, 1,…, n-1} and vertices u and v are adjacent, if gcd(uv, n) = 1. In [A. Ilić, The energy of unitary Cayley graphs, Linear Algebra Appl. 431 (2009) 1881–1889], the energy of unitary Cayley graphs is computed. In this paper the Wiener and hyperWiener index of Xn is computed.
full texton the eigenvalues of normal edge-transitive cayley graphs
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...
full textDiscrepancy and Eigenvalues of Cayley Graphs
We consider quasirandom properties for Cayley graphs of finite abelian groups. In particular, we show that having uniform edgedistribution (i.e., small discrepancy) and having large eigenvalue gap are equivalent properties for Cayley graphs, even if they are sparse. This positively answers a question of Chung and Graham [“Sparse quasi-random graphs”, Combinatorica 22 (2002), no. 2, 217–244] for...
full textMy Resources
Journal title
volume 7 issue 2
pages 189- 203
publication date 2020-01-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023