Name
Abstract | ||
|---|---|---|
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. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.disc.2022.112892 | DISCRETE MATHEMATICS |
Keywords | DocType | Volume |
Unique perfect matching, <p>[a,b]-factor</p>, Spectral radius | Journal | 345 |
Issue | ISSN | Citations |
7 | 0012-365X | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Dandan Fan | 1 | 2 | 2.60 |
| Huiqiu Lin | 2 | 34 | 11.56 |
| Hongliang Lu | 3 | 17 | 6.74 |