The distance spectral radius of a connected graph is the largest eigenvalue of its distance matrix. We determine the unique non-starlike non-caterpillar tree with maximal distance spectral radius.
@article{bwmeta1.element.doi-10_1515_spma-2017-0021,
author = {Yanna Wang and Rundan Xing and Bo Zhou and Fengming Dong},
title = {A note on distance spectral radius of trees},
journal = {Special Matrices},
volume = {5},
year = {2017},
pages = {296-300},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.doi-10_1515_spma-2017-0021}
}
Yanna Wang; Rundan Xing; Bo Zhou; Fengming Dong. A note on distance spectral radius of trees. Special Matrices, Tome 5 (2017) pp. 296-300. http://gdmltest.u-ga.fr/item/bwmeta1.element.doi-10_1515_spma-2017-0021/