Distance spectral radius of a tree with given diameter
Combinatorics
2013-10-24 v1
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.
Keywords
Cite
@article{arxiv.1310.6152,
title = {Distance spectral radius of a tree with given diameter},
author = {Guanglong Yu and Shuguang Guo and Mingqing Zhai},
journal= {arXiv preprint arXiv:1310.6152},
year = {2013}
}
Comments
10 pages,7 figures