2024/12/21 by Jifu Lin, Lin, Jifu, Du, Zenan +3
Computer Science · Mathematics · #05C35 #05C40 #05C50 #Advanced Graph Theory Research #Combinatorics (math.CO) #FOS: Mathematics #Graph Theory and Algorithms #Graph theory and applications
paper · pdf · doi:10.48550/arxiv.2412.16505
openalex publication_date 2024/12/21 · openalex created_date 2024/12/25 · openalex updated_date 2026/07/28
Let G be a connected graph of order n. A spanning k-tree of G is a spanning tree with the maximum degree at most k, and a spanning k-ended-tree of G is a spanning tree at most k leaves, where k≥2 is an integer. This paper establishes some spectral conditions for the existence of spanning k-trees or spanning k-ended-trees in t-connected graphs, which generalize the results of Fan et al. (2022) and Zhou (2010), and improve the results of Fiedler et al. (2010), Ao et al. (2023) and Ao et al. (2025).