Geodesic
Some properties of unitary Cayley graphs
The electronic journal of combinatorics, Tome 14 (2007)

Voir la notice de l'article provenant de la source The Electronic Journal of Combinatorics website

Zbl EuDML
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 
Walter Klotz; Torsten Sander. Some properties of unitary Cayley graphs. The electronic journal of combinatorics, Tome 14 (2007). doi: 10.37236/963
@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/}
}
TY  - JOUR
AU  - Walter Klotz
AU  - Torsten Sander
TI  - Some properties of unitary Cayley graphs
JO  - The electronic journal of combinatorics
PY  - 2007
VL  - 14
UR  - http://geodesic.mathdoc.fr/articles/10.37236/963/
DO  - 10.37236/963
ID  - 10_37236_963
ER  - 
%0 Journal Article
%A Walter Klotz
%A Torsten Sander
%T Some properties of unitary Cayley graphs
%J The electronic journal of combinatorics
%D 2007
%V 14
%U http://geodesic.mathdoc.fr/articles/10.37236/963/
%R 10.37236/963
%F 10_37236_963

Cité par Sources :