On Distance Spectral Radius and Distance Energy of Graphs

Abstract

For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix, and the distance energy is defined as the sum of the absolute values of the eigenvalues of its distance matrix. We establish lower and upper bounds for the distance spectral radius of graphs and bipartite graphs, lower bounds for the distance energy of graphs, and characterize the extremal graphs. We also discuss upper bounds for the distance energy.

arXiv comment20 pages

Cited by in corpus (7)

• On Minimum Terminal Distance Spectral Radius of Trees with Given Degree Sequence
• Distance matrix correlation spectrum of graphs
• The Distance Energy of Clique Trees
• On the sum of $k$-th largest distance eigenvalues of graphs
• Bounds of distance Estrada index of graphs
• Distance integral complete multipartite graphs with $s=5,6$
• Spectra of Cayley Graphs of Complex Reflection Groups