Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 1956-1963 |
| Number of pages | 8 |
| Journal | Linear Algebra and Its Applications |
| Volume | 428 |
| Issue number | 8-9 |
| DOIs | |
| Publication status | Published - 15 Apr 2008 |
Keywords
- Circulant graphs
- Energy of graphs
Fingerprint
Dive into the research topics of 'On the average energy of circulant graphs'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver