整循环图的能量公式

摘要

循环图是互联网络环境下的分布式并行计算中一类非常重要的拓扑图。一个图叫做循环图，如果它是循环群上的Cayley 图，也即它的邻接矩阵是一个循环矩阵。若循环图的邻接矩阵的特征值全为整数，则称此循环图为整循环图。图的能量是图的特征值的绝对值的和。本文主要研究整循环图的能量计算公式。%Circulant graphs are an important class of interconnection networks in parallel and distributed computing .A graph is called circulant if it is Cayley graph on the circulant group ,i.e.its adjacency matrix is circulant .A graph is called integral if all ei-genvalues of its adjacency matrix are integers .The energy is defined as the sum of absolute values of its eigenvalues .In this paper , we show here that the energy calculation formulas .