A Classification of Ramanujan Unitary Cayley Graphs
Keyword(s):
The unitary Cayley graph on $n$ vertices, $X_n$, has vertex set ${\Bbb Z}/{n\Bbb Z}$, and two vertices $a$ and $b$ are connected by an edge if and only if they differ by a multiplicative unit modulo $n$, i.e. ${\rm gcd}(a-b,n) = 1$. A $k$-regular graph $X$ is Ramanujan if and only if $\lambda(X) \leq 2\sqrt{k-1}$ where $\lambda(X)$ is the second largest absolute value of the eigenvalues of the adjacency matrix of $X$. We obtain a complete characterization of the cases in which the unitary Cayley graph $X_n$ is a Ramanujan graph.
2018 ◽
Vol 17
(09)
◽
pp. 1850178
◽
2013 ◽
Vol 14
(04)
◽
pp. 1350020
◽
Keyword(s):
Keyword(s):
2014 ◽
Vol 13
(05)
◽
pp. 1350152
◽
Keyword(s):
2018 ◽
Vol 82
(5)
◽
pp. 1049-1055
◽
2019 ◽
Vol 29
(02)
◽
pp. 279-308
2012 ◽
Vol 2012
◽
pp. 1-7
◽
Keyword(s):
1996 ◽
Vol 28
(01)
◽
pp. 227-251
◽