We obtain upper and lower bounds on the average energy of circulant graphs with it vertices and regularity d. The average is taken over all representations of such graphs by circulant adjacency matrices. (C) 2007 Elsevier Inc. All rights reserved.
展开▼
