Distance equienergetic graphs

作者：Ramane H S^*; Gutman I; Revankar D S

来源：MATCH-Communications in Mathematical and in Computer Chemistry, 2008, 60(2): 473-484.

The distance energy E-D(G) of a graph G is defined as the sum of the absolute values of the eigenvalues of the distance matrix of G. The graphs G(1) and G(2) are said to be distance equienergetic (D-equienergetic) if E-D(G(1)) = E-D(G2). In this paper we obtain the eigenvalues of the distance matrix of the join of two graphs whose diameter is less than or equal to 2, and construct pairs of non D-cospectral, D-equienergetic graphs on n vertices for all n >= 9.

• 出版日期2008