Some Properties of Unitary Cayley Graphs
Copyright policy )Some Properties of Unitary Cayley Graphs
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.
Graphs and linear algebra (matrices, eigenvalues, etc.), chromatic number, connectivity, independence number, diameter, clique number, Graphs and abstract algebra (groups, rings, fields, etc.)
Graphs and linear algebra (matrices, eigenvalues, etc.), chromatic number, connectivity, independence number, diameter, clique number, Graphs and abstract algebra (groups, rings, fields, etc.)
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).84 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Top 10% influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 1% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!