A note on distance spectral radius of trees

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.

Bibliographic Details
Main Authors: Wang Yanna, Xing Rundan, Zhou Bo, Dong Fengming
Format: Article
Language:English
Published: De Gruyter 2017-11-01
Series:Special Matrices
Subjects:
Online Access:http://www.degruyter.com/view/j/spma.2017.5.issue-1/spma-2017-0021/spma-2017-0021.xml?format=INT