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: | Dadedzi Kenneth, Misanantenaina Valisoa Razanajatovo, Wagner Stephan |
---|---|
Format: | Article |
Language: | English |
Published: |
Sciendo
2020-05-01
|
Series: | Discussiones Mathematicae Graph Theory |
Subjects: | |
Online Access: | https://doi.org/10.7151/dmgt.2271 |
Similar Items
-
Spectral Radius and Hamiltonicity of Graphs
by: Yu Guidong, et al.
Published: (2019-11-01) -
Spectral Conditions for Graphs to be k-Hamiltonian or k-Path-Coverable
by: Liu Weijun, et al.
Published: (2020-02-01) -
Functions on adjacent vertex degrees of trees with given degree sequence
by: Wang Hua
Published: (2014-11-01) -
On the α-Spectral Radius of Uniform Hypergraphs
by: Guo Haiyan, et al.
Published: (2020-05-01) -
A note on distance spectral radius of trees
by: Wang Yanna, et al.
Published: (2017-11-01)