A classification of Ramanujan unitary Cayley graphs
Summary: The unitary Cayley graph on \(n\) vertices, \(X_n\), has vertex set \(\frac{\mathbb Z}{n\mathbb 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. 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.
- On the polynomial Ramanujan sums over finite fields
- Distance powers of unitary Cayley graphs
- Ramanujan grammar and Cayley trees
- Eigenvalues of Cayley graphs
- Ramanujan sums as supercharacters
- Integral circulant Ramanujan graphs via multiplicativity and ultrafriable integers
- Unitary addition Cayley signed graphs
- Integral circulant Ramanujan graphs of prime power order
- The maximal energy of classes of integral circulant graphs
- Extremal energies of integral circulant graphs via multiplicativity
- Approximately dual and dual frames in quaternionic Hilbert spaces
- Spectrum of Graphs over Rings: A Survey
- Ramanujan expansions of arithmetic functions of several variables over \(\mathbb{F}_q [t]\)
- Ramanujan unitary one-matching bi-Cayley graphs over finite commutative rings
- Some applications of eigenvalues of unitary Cayley graphs of matrix rings over finite fields
- When unit graphs are isomorphic to unitary Cayley graphs of rings?
This page was built for publication: A classification of Ramanujan unitary Cayley graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976684)
