𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the energy of some circulant graphs

✍ Scribed by Igor Shparlinski

Publisher
Elsevier Science
Year
2006
Tongue
English
Weight
94 KB
Volume
414
Category
Article
ISSN
0024-3795

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the average energy of circulant graph
On the average energy of circulant graphs
✍ Simon R. Blackburn; Igor E. Shparlinski πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 122 KB

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.

On isomorphic factorizations of circulan
On isomorphic factorizations of circulant graphs
✍ Brian Alspach; Danny Dyer; Donald L. Kreher πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 112 KB

## Abstract We investigate the conjecture that every circulant graph __X__ admits a __k__‐isofactorization for every __k__ dividing |__E__(__X__)|. We obtain partial results with an emphasis on small values of __k__. Β© 2006 Wiley Periodicals, Inc. J Combin Designs 14: 406–414, 2006

On the chromatic number of integral circ
On the chromatic number of integral circulant graphs
✍ Aleksandar IliΔ‡; Milan BaΕ‘iΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 395 KB

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

Distance spectra and distance energy of
Distance spectra and distance energy of integral circulant graphs
✍ Aleksandar IliΔ‡ πŸ“‚ Article πŸ“… 2010 πŸ› Elsevier Science 🌐 English βš– 189 KB

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