The Distance Energy of Circulant Graphs  

作　　者：ZHOU Hou-qing 

机构地区：[1]Department of Mathematics, Shaoyang University, Hunan, 422000, P.R. China

出　　处：《Chinese Quarterly Journal of Mathematics》2018年第3期233-239,共7页数学季刊（英文版）

基　　金：Project Supported by Scientific Research Fund of Hunan Provincial Education Department(15C1235)

摘　　要：For a connected graph G, the distance energy of G is a recently developed energytype invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix G. A graph is called circulant if it is Cayley graph on the circulant group, i.e., its adjacency matrix is circulant. In this note, we establish lower bounds for the distance energy of circulant graphs. In particular, we discuss upper bound of distance energy for the 4-circulant graph.For a connected graph G, the distance energy of G is a recently developed energytype invariant, defined as the sum of absolute values of the eigenvalues of the distance matrix G. A graph is called circulant if it is Cayley graph on the circulant group, i.e., its adjacency matrix is circulant. In this note, we establish lower bounds for the distance energy of circulant graphs. In particular, we discuss upper bound of distance energy for the 4-circulant graph.

关 键 词：DISTANCE EIGENVALUE DISTANCE ENERGY CIRCULANT GRAPH 

分 类 号：O157.5[理学—数学]