Distance spectral radius of a tree with given diameter
classification
🧮 math.CO
keywords
distanceradiusspectraldiametergiventreescharacterizedcompletely
read the original abstract
For a connected graph, the distance spectral radius is the largest eigenvalue of its distance matrix. In this paper, of all trees with both given order and fixed diameter, the trees with the minimal distance spectral radius are completely characterized.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.