A Note on D-Equienergetic Graphs

作者：Liu, Muhuo^*

来源：MATCH-Communications in Mathematical and in Computer Chemistry, 2010, 64(1): 135-140.

• LARGEST EIGENVALUE
• DISTANCE MATRIX
• NUMBER
• ENERGY
• PAIR

The distance energy of a graph G is defined as the sum of the absolute values of the eigenvalues of the distance matrix of C. Two graphs with the same distance energy (resp. different distance matrix spectra) are called D-equienergetic (resp. non-D-cospectral). Recently. Indulal et. al. proved that there exists pairs of non-D-cospectral D-equienergetic graphs of order n when n equivalent to 1(mod 3) or n equivalent to 0(mod 6). In this paper, we prove that there exist pairs of non-D-cospectral D-equienergetic graphs of order a for every n >= 6.

• 出版日期2010
• 单位华南农业大学