| Issue |
RAIRO-Oper. Res.
Volume 58, Number 4, July-August 2024
|
|
|---|---|---|
| Page(s) | 3233 - 3240 | |
| DOI | https://doi.org/10.1051/ro/2024126 | |
| Published online | 08 August 2024 | |
A spectral condition for component factors in graphs
1
School of Public Management, Jiangsu University of Science and Technology, Zhenjiang, Jiangsu 212100, P.R. China
2
School of Economics and Management, Wenzhou University of Technology, Wenzhou, Zhejiang 325000, P.R. China
* Corresponding author: wangsufangjust@163.com
Received:
26
October
2023
Accepted:
8
June
2024
Let G be a graph. A {K1,2, K1,3, K5}-factor of G is a spanning subgraph of G, in which every component is isomorphic to a member of {K1,2, K1,3, K5}. In this paper, we establish a lower bound on the spectral radius of G to ensure that G contains a {K1,2, K1,3, K5}-factor.
Mathematics Subject Classification: 05C50 / 05C70 / 68M10
Key words: Graph / spectral radius / component factor
© The authors. Published by EDP Sciences, ROADEF, SMAI 2024
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (https://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.