Some properties of unitary Cayley graphs
The electronic journal of combinatorics, Tome 14 (2007)
The unitary Cayley graph $X_n$ has vertex set $Z_n=\{0,1, \ldots ,n-1\}$. Vertices $a, b$ are adjacent, if gcd$(a-b,n)=1$. For $X_n$ the chromatic number, the clique number, the independence number, the diameter and the vertex connectivity are determined. We decide on the perfectness of $X_n$ and show that all nonzero eigenvalues of $X_n$ are integers dividing the value $\varphi(n)$ of the Euler function.
DOI :
10.37236/963
Classification :
05C25, 05C50
Mots-clés : chromatic number, clique number, independence number, diameter, connectivity
Mots-clés : chromatic number, clique number, independence number, diameter, connectivity
@article{10_37236_963,
author = {Walter Klotz and Torsten Sander},
title = {Some properties of unitary {Cayley} graphs},
journal = {The electronic journal of combinatorics},
year = {2007},
volume = {14},
doi = {10.37236/963},
zbl = {1121.05059},
url = {http://geodesic.mathdoc.fr/articles/10.37236/963/}
}
Walter Klotz; Torsten Sander. Some properties of unitary Cayley graphs. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/963
Cité par Sources :