QA145 : Some Properties Of Unitary Cayley Graphs
Thesis > Central Library of Shahrood University > Mathematical Sciences > MSc > 2013
Authors:
Efat Koshkee [Author], Jafari Mir Heidar[Supervisor], [Advisor]
Abstarct: The unitary cayley graph Xn has vertex set Zn = {0, 1, ..., n − 1}. vertices a and b are adjacent, if gcd(a − b, n) = 1. For Xn chromatic number, the clique number, the independence number, the diameter and the vertex connectivity are determined. We deside under perfect ness of Xn and show that all nonzero eigenvalues of Xn are integers dividing the value φ(n) of the Euler function.
Keywords:
#unitary cayley graph #clique number #chromatic number #vertex connectivity #eigenvalues #independence number Link
Keeping place: Central Library of Shahrood University
Visitor: