The spanning $k$-trees, perfect matchings and spectral radius of graphs
Combinatorics
2023-04-24 v2
Abstract
A -tree is a spanning tree in which every vertex has degree at most . In this paper, we provide a sufficient condition for the existence of a -tree in a connected graph with fixed order in terms of the adjacency spectral radius and the signless Laplacian spectral radius, respectively. Also, we give a similar condition for the existence of a perfect matching in a balanced bipartite graph with fixed order and minimum degree.
Keywords
Cite
@article{arxiv.2103.14323,
title = {The spanning $k$-trees, perfect matchings and spectral radius of graphs},
author = {Dandan Fan and Sergey Goryainov and Xueyi Huang and Huiqiu Lin},
journal= {arXiv preprint arXiv:2103.14323},
year = {2023}
}
Comments
12 pages