Affiliation:
1. Faculty of Sciences and Mathematics, Department of Computer Science, University of Niš, Niš, Serbia
Abstract
The integral circulant graph ICGn(D) has the vertex set Zn = {0, 1, 2, . . .
, n? 1} and vertices a and b are adjacent if gcd(a ? b, n) ? D, where D ?
Dn, Dn = {d : d | n, 1 ? d < n}. Motivated by the incorrect proof of a
previously published result, in this paper we characterize the class of
integral circulant graphs that are strongly regular. More precisely,
connected ICGn(D) is strongly regular if and only if n is composite and D =
{d ? Dn | m ? d} for some m | n and n ? 1 ? m ? 2.
Publisher
National Library of Serbia
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics,Analysis
Reference14 articles.
1. M. Bašić: Which weighted circulant networks have perfect state transfer?. Inf. Sciences, 257 (2014), 193-209.
2. D. Cvetkovic, M. Doob, H. Sachs: Spectra of Graphs: Theory and Application. Academic Press, New York, 1980.
3. T. T. Chelvam, S. Raja, I. Gutman: Strongly regular integral circulant graphs and their enegies. Bull. Inter. Math. Virtual Inst., 2 (2012), 9-16.
4. E. R. van Dam: Regular Graphs With Four Eigenvalues. Linear Algebra Appl., 226- 228 (1995), 139-162.
5. P. J. Davis: Circulant Matrices. Wiley, New York, 1970.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献