On the Distance Spectral Radius of Trees with Given Degree Sequence
We consider the problem of maximizing the distance spectral radius and a slight generalization thereof among all trees with some prescribed degree sequence. We prove in particular that the maximum of the distance spectral radius has to be attained by a caterpillar for any given degree sequence. The...
Main Authors: | , , |
---|---|
Format: | Article |
Language: | English |
Published: |
University of Zielona Góra
2020-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2271 |