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

Jiaxin Zheng; Xueyi Huang; Junjie Wang

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

Combinatorics 2023-05-09 v1

Authors: Jiaxin Zheng , Xueyi Huang , Junjie Wang

Abstract

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).

Keywords

spanning trees trees phylogenetic trees

Cite

@article{arxiv.2305.04211,
  title  = {Spectral condition for spanning $k$-ended trees in $t$-connected graphs},
  author = {Jiaxin Zheng and Xueyi Huang and Junjie Wang},
  journal= {arXiv preprint arXiv:2305.04211},
  year   = {2023}
}

Comments

9 pages

Related papers

View all related →