Publication Type : Journal Article
Source : Discrete Mathematics, Algorithms and Applications
Url : https://www.worldscientific.com/doi/abs/10.1142/S179383091850057X
Campus : Nagercoil
School : School of Computing
Year : 2018
Abstract : Let S⊂Zn𝑆⊂ℤ𝑛, the finite cyclic group of order n≥1𝑛≥1. Assume that 0∉S0∉𝑆 and −S={−s:s∈S}=S−𝑆={−𝑠:𝑠∈𝑆}=𝑆. The circulant graph G=Cir(n,S)𝐺=Cir(𝑛,𝑆) is the undirected graph having the vertex set V(G)=Zn𝑉(𝐺)=ℤ𝑛 and edge set E(G)={ab:a,b∈Zn,a−b∈S}𝐸(𝐺)={𝑎𝑏:𝑎,𝑏∈ℤ𝑛,𝑎−𝑏∈𝑆}. Let D𝐷 be a set of positive, proper divisors of the integer n𝑛. In this paper, by using D,𝐷, we characterize certain connected integral circulant graphs with four distinct eigenvalues.
Cite this Research Publication : Tamizh Chelvam T, Raja S, Integral Circulant graphs with four distinct eigenvalues, Discrete Mathematics, Algorithms and Applications, 10 (05), 1850057, 2018