Research Article
B. S. Durgi, P. R. Hampiholi a
Abstract
The D-eigenvalues (distance eigenvalues) of a connected graph G are the eigenvalues of the distance matrix D = D(G) of G. The collection of D - eigenvalues is the D - spectrum (distance spectrum) of G. In this paper, the distance polynomial, distance spectra and distance energy of some edge deleted graphs called cluster graphs are obtained.