On the distance spectra of some graphs

By Gopalapillai Indulal, Ivan Gutman. 2008

76 citations recorded by the source corpus.

T heD-eigenvalues of a connected graph G are the eigen- values of its distance matrix D ,a nd form theD-spectrum of G.T he D-energy ED(G) of the graph G is the sum of the absolute values of its D-eigenvalues. Two (connected) graphs are said to be D-equienergetic if they have equal D-energies. The D-spectra of some graphs and their D-energies are calculated. A pair of D-equienergetic bipartite graphs on 24 t, t ≥ 3, vertices is constructed.

View Paper: https://www.semanticscholar.org/paper/f36d1ec44e56a01b3087513d6899041471fcc508

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Sharp bounds on the distance spectral radius and the distance energy of graphs (2009, background): “For some recent works on distance spectrum and D-energy of graphs, see [8,9].”
Distance spectral radius of trees with fixed maximum degree (2010, background): “For more details on distance matrices and distance energy, see [6, 11, 15, 16, 19, 23].”
DISTANCE SPECTRA AND DISTANCE ENERGIES OF ITERATED LINE GRAPHS OF REGULAR GRAPHS (2009, background): “The characteristic polynomial and eigenvalues of the distance matrix of graphs have been considered in [9, 10, 11, 16, 17, 18, 19, 34].”
On Distance Spectral Radius and Distance Energy of Graphs (2011, result): “For more recent results on DE see [20–23].”