Connectivity, diameter, independence number and the distance spectral radius of graphs
Sign Up to like & getrecommendations! Published in 2017 at "Linear Algebra and its Applications"
DOI: 10.1016/j.laa.2017.04.014
Abstract: Abstract The distance spectral radius of a graph is the largest eigenvalue of its distance matrix. X.L. Zhang (2012) [31] determined the n -vertex graphs of given diameter with the minimum distance spectral radius. In… read more here.
Keywords: graphs; spectral radius; distance; connectivity ... See more keywords