Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs

Fuente: arXiv
Guardado en:
Detalles Bibliográficos
Autores principales: Lin, Jifu, Du, Zenan, Zhao, Xinghui, You, Lihua
Formato: Preprint
Publicado: 2024
Materias:
Acceso en línea:
Etiquetas: Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
_version_ 1866915332350803968
author Lin, Jifu
Du, Zenan
Zhao, Xinghui
You, Lihua
author_facet Lin, Jifu
Du, Zenan
Zhao, Xinghui
You, Lihua
contents 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\geq2$ 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).
format Preprint
id arxiv_https___arxiv_org_abs_2412_16505
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
Lin, Jifu
Du, Zenan
Zhao, Xinghui
You, Lihua
Combinatorics
05C50, 05C35, 05C40
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\geq2$ 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).
title Spectral conditions for spanning $k$-trees or $k$-ended-trees of $t$-connected graphs
topic Combinatorics
05C50, 05C35, 05C40
url https://arxiv.org/abs/2412.16505