New results on the energy of integral circulant graphs
✍ Scribed by Aleksandar Ilić; Milan Bašić
- Book ID
- 113439808
- Publisher
- Elsevier Science
- Year
- 2011
- Tongue
- English
- Weight
- 271 KB
- Volume
- 218
- Category
- Article
- ISSN
- 0096-3003
No coin nor oath required. For personal study only.
📜 SIMILAR VOLUMES
The distance energy of a graph G is a recently developed energy-type invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix of G. There was a vast research for the pairs and families of non-cospectral graphs having equal distance energy, and most of these construc
Integral circulant graphs are a generalization of unitary Cayley graphs, recently studied by Klotz and Sander. The integral circulant graph X n (D) has vertices 0, 1, . . . , n -1, and two vertices a and b are adjacent iff gcd(xy, n) ∈ D, where D ⊆ {d : Circulant graphs have various applications in
We obtain upper and lower bounds on the average energy of circulant graphs with n vertices and regularity d. The average is taken over all representations of such graphs by circulant adjacency matrices.