文献类型：期刊文献

英文题名：The spanning k-trees, perfect matchings and spectral radius of graphs

作者：Fan, Dandan[1];Goryainov, Sergey[2];Huang, Xueyi[1];Lin, Huiqiu[1]

机构：[1]East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China;[2]Chelyabinsk State Univ, Dept Math, Chelyabinsk, Russia

年份：2022

卷号：70

期号：21

起止页码：7264

外文期刊名：LINEAR & MULTILINEAR ALGEBRA

收录：;WOS:【SCI-EXPANDED(收录号:WOS:000703416100001)】；

基金：This work was supported by National Natural Science Foundation of China [11771141,11901540, 12011530064] the Russian Foundation for Basic Research (RFBR) [20-51-53023].

语种：英文

外文关键词：k-tree; perfect matching; spectral radius

摘要：A k-tree is a spanning tree in which every vertex has degree at most k. In this paper, we provide a sufficient condition for the existence of a k-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.