Spectral condition for spanning $k$-ended trees in $t$-connected graphs

Autor:	Zheng, Jiaxin, Huang, Xueyi, Wang, Junjie
Rok vydání:	2023
Předmět:	Mathematics - Combinatorics 05C50
Druh dokumentu:	Working Paper
Popis:	For any integer $k\geq 2$, a spanning $k$-ended tree is a spanning tree with at most $k$ leaves. In this paper, we provide a tight spectral radius condition for the existence of a spanning $k$-ended tree in $t$-connected graphs, which generalizes a result of Ao, Liu and Yuan (2023). Comment: 9 pages
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/2305.04211 Zobrazit plný text záznamu View this record from Arxiv