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 条
  • [1] Laplacian eigenvalue condition for a graph to have the strong parity property
    Wang, Sufang
    Zhang, Wei
    RAIRO-OPERATIONS RESEARCH, 2025, 59 (01) : 391 - 396
  • [2] A degree condition for a graph to have (a, b)-parity factors
    Liu, Haodong
    Lu, Hongliang
    DISCRETE MATHEMATICS, 2018, 341 (01) : 244 - 252
  • [3] Sufficient conditions for graphs to have strong parity factors
    Zhou, Sizhong
    Zhang, Yuli
    RAIRO-OPERATIONS RESEARCH, 2023, 57 (05) : 2465 - 2471
  • [4] A degree condition for a graph to have [a,b]-factors
    Li, YJ
    Cai, MC
    JOURNAL OF GRAPH THEORY, 1998, 27 (01) : 1 - 6
  • [5] A SUFFICIENT CONDITION FOR A GRAPH TO HAVE [A,B]-FACTORS
    KANO, M
    GRAPHS AND COMBINATORICS, 1990, 6 (03) : 245 - 251
  • [6] A Degree Condition for a Graph to Have [a, b]-Factors
    Institute of Systems Science, Chinese Academy of Sciences, Beijing, China
    J. Graph Theory, 1 (1-6):
  • [7] Sufficient Conditions for a Graph to Have All [a, b]-Factors and (a, b)-Parity Factors
    Zixuan Yang
    Xuechun Zhang
    Hongliang Lu
    Yuqing Lin
    Bulletin of the Malaysian Mathematical Sciences Society, 2022, 45 : 1657 - 1667
  • [8] Sufficient Conditions for a Graph to Have All [a, b]-Factors and (a, b)-Parity Factors
    Yang, Zixuan
    Zhang, Xuechun
    Lu, Hongliang
    Lin, Yuqing
    BULLETIN OF THE MALAYSIAN MATHEMATICAL SCIENCES SOCIETY, 2022, 45 (04) : 1657 - 1667
  • [9] Spectral condition for Hamiltonicity of a graph
    Benediktovich, Vladimir I.
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2015, 494 : 70 - 79
  • [10] A Characterization for Graphs Having Strong Parity Factors
    Lu, Hongliang
    Yang, Zixuan
    Zhang, Xuechun
    GRAPHS AND COMBINATORICS, 2021, 37 (03) : 945 - 949
12345