Sharp bounds on distance spectral radius of graphs |
| |
Authors: | Huiqiu Lin |
| |
Affiliation: | Department of Mathematics , East China Normal University , Shanghai 200062 , China |
| |
Abstract: | Let D(G) denote the distance matrix of a connected graph G. The largest eigenvalue of D(G) is called the distance spectral radius of a graph G, denoted by ?(G). In this article, we give sharp upper and lower bounds for the distance spectral radius and characterize those graphs for which these bounds are best possible. |
| |
Keywords: | distance spectral radius average distance degree pseudo distance regular |
|
|