A note on distance spectral radius of trees

@article{YannaWang2017,
abstract = {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.},
author = {Yanna Wang, Rundan Xing, Bo Zhou, Fengming Dong},
journal = {Special Matrices},
keywords = {distance spectral radius; distance Perron vector; non-starlike tree; non-caterpillar tree},
language = {eng},
number = {1},
pages = {296-300},
title = {A note on distance spectral radius of trees},
url = {http://eudml.org/doc/288487},
volume = {5},
year = {2017},
}

TY - JOUR
AU - Yanna Wang
AU - Rundan Xing
AU - Bo Zhou
AU - Fengming Dong
TI - A note on distance spectral radius of trees
JO - Special Matrices
PY - 2017
VL - 5
IS - 1
SP - 296
EP - 300
AB - 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.
LA - eng
KW - distance spectral radius; distance Perron vector; non-starlike tree; non-caterpillar tree
UR - http://eudml.org/doc/288487
ER -