文献类型：期刊文献

英文题名：Spectral radius and [a, b]-factors in graphs

作者：Fan, Dandan[1,2];Lin, Huiqiu[1];Lu, Hongliang[3]

机构：[1]East China Univ Sci & Technol, Sch Math, Shanghai 200237, Peoples R China;[2]Xinjiang Agr Univ, Coll Math & Phys, Urumqi 830052, Xinjiang, Peoples R China;[3]Xi An Jiao Tong Univ, Sch Math & Stat, Xian 710049, Shaanxi, Peoples R China

年份：2022

卷号：345

期号：7

外文期刊名：DISCRETE MATHEMATICS

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

基金：This work is supported by the National Natural Science Foundation of China (Grant Nos. 11771141, 12011530064 and 11871391) .

语种：英文

外文关键词：Unique perfect matching; [a,b]-factor; Spectral radius

摘要：An [a, b] -factor of a graph G is a spanning subgraph H such that a <= d(H)(v) <= b for each v is an element of V(G). In this paper, we provide spectral conditions for the existence of an odd [1, b] -factor in a connected graph with minimum degree delta and the existence of an [a, b] -factor in a graph, respectively. Our results generalize and improve some previous results on perfect matchings of graphs. For a = 1, we extend the result of O [31] to obtain an odd [1, b] -factor and further generalize the result of Liu, Liu and Feng [28] for a = b = 1. For n >= 3a + b - 1, we confirm the conjecture of Cho, Hyun, O and Park [5]. We conclude some open problems in the end. (C) 2022 Elsevier B.V. All rights reserved.