Spectral Condition for Spanning k-Ended Trees in t-Connected Graphs
For any integer [Formula: see text], a spanning [Formula: see text]-ended tree is a spanning tree with at most [Formula: see text] leaves. In this paper, we provide tight spectral radius conditions for the existence of a spanning [Formula: see text]-ended tree in [Formula: see text]-connected graphs, which generalizes a result of Ao, Liu and Yuan (2023).
Authors
- Jiaxin Zheng (ORCID: https://orcid.org/0000-0002-8796-0551)
- Yi-Xiang Wang (ORCID: https://orcid.org/0000-0002-4021-4228)
- Xueyi Huang
Institutions
- East China University of Science and Technology (CN)
Publication Details
- Journal
- Algebra Colloquium
- Published
- 2026-02-27
- DOI
- https://doi.org/10.1142/s1005386726000039
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00