A spectral condition for a graph to have strong parity factors

被引：2
|
作者：
Zhou, Sizhong [1 ]
Zhang, Tao [2 ]
Bian, Qiuxiang [1 ]
机构：
[1] Jiangsu Univ Sci & Technol, Sch Sci, Zhenjiang 212100, Jiangsu, Peoples R China
[2] Jiangsu Univ Sci & Technol, Sch Econ & Management, Zhenjiang 212100, Jiangsu, Peoples R China
来源：
DISCRETE APPLIED MATHEMATICS | 2025年 / 360卷
关键词：
Graph; Spectral radius; Minimum degree; Strong parity factor; INDEPENDENCE NUMBER; PATH-FACTORS; EXISTENCE;
D O I：
10.1016/j.dam.2024.09.003
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph G has the strong parity property if for every subset X subset of V(G) with |X| even, G has a spanning subgraph F satisfying delta(F) >= 1, dF(u)equivalent to 1 (mod 2) for any u is an element of X, and d(F)(v)equivalent to 0 (mod 2) for any v is an element of V(G)\X. In this paper, we give a spectral radius condition to guarantee that a connected graph has the strong parity property. (c) 2024 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.
引用
收藏
页码：188 / 195
页数：8
相关论文
共 50 条
12345