Some properties of unitary Cayley graphs (Q2372889)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Some properties of unitary Cayley graphs |
scientific article; zbMATH DE number 5171578
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Some properties of unitary Cayley graphs |
scientific article; zbMATH DE number 5171578 |
Statements
Some properties of unitary Cayley graphs (English)
0 references
16 July 2007
0 references
Summary: The unitary Cayley graph \(X_n\) has vertex set \(Z_n=\{0,1, \dots ,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.
0 references
chromatic number
0 references
clique number
0 references
independence number
0 references
diameter
0 references
connectivity
0 references
0.9614519
0 references
0.93776214
0 references
0 references
0.92718804
0 references
0.92560834
0 references
0 references
0 references
0 references
0.9194928
0 references
