PreprintarXiv licencearXiv
Minimum Distance Spectral Radius of Tree with Given Maximum Degree
Abstract
In this article, the unique graph with minimum distance spectral radius among trees with given order n and maximum degree varDelta is determined, where 2varDelta+1 ≤ n ≤ varDelta2 +1 for varDelta ≥ 3. This article is a part proof of the conjecture proposed in citeref1.
Related
- Extremal spectral radius of nonregular graphs with a fixed odd maximum degree
- Nonregular graphs of odd maximum degree with maximum spectral radius
- Size and spectral radius conditions for the existence of k-factor in graphs with given minimum degree
- On the Minimum Possible Maximum Degree of Induced Subgraphs of Product Graphs
- Asymptotic maximum spectral radius of nonregular graphs
BibTeX
@misc{li2026minimum,
title = {{Minimum Distance Spectral Radius of Tree with Given Maximum Degree}},
author = {Yifei Li and Zia Ullah Khan},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.34114},
eprint = {2610.34114},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.34114},
}
RIS
TY - UNPB
TI - Minimum Distance Spectral Radius of Tree with Given Maximum Degree
AU - Yifei Li
AU - Zia Ullah Khan
PY - 2026
DA - 2026/10/25
PB - arXiv
DO - 10.48550/arxiv.2610.34114
UR - https://arxiv.org/abs/2610.34114
AB - In this article, the unique graph with minimum distance spectral radius among trees with given order n and maximum degree varDelta is determined, where 2varDelta+1 ≤ n ≤ varDelta^2 +1 for varDelta ≥ 3. This article is a part proof of the conjecture proposed in citeref1.
ER -