On the average energy of circulant graphs

Simon R. Blackburn, Igor E. Shparlinski*

*Corresponding author for this work

Research output: Contribution to journalArticle

16 Citations (Scopus)

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 languageEnglish
Pages (from-to)1956-1963
Number of pages8
JournalLinear Algebra and Its Applications
Volume428
Issue number8-9
DOIs
Publication statusPublished - 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