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 条
  • [31] A Degree Condition for Graphs to Have (g, f)-Factors
    Zhou, Sizhong
    Pu, Bingyuan
    ARS COMBINATORIA, 2012, 107 : 307 - 315
  • [32] A sufficient condition for graphs to have Hamiltonian [a, b]-factors
    Zhou, Sizhong
    World Academy of Science, Engineering and Technology, 2009, 33 : 966 - 968
  • [33] A neighborhood condition for graphs to have [a, b]-factors II
    Matsuda, H
    GRAPHS AND COMBINATORICS, 2002, 18 (04) : 763 - 768
  • [34] A neighborhood condition for graphs to have [a, b]-factors III
    Kano, M.
    Matsuda, Haruhide
    DISCRETE GEOMETRY, COMBINATORICS AND GRAPH THEORY, 2007, 4381 : 70 - +
  • [35] Proof of a conjecture on the spectral radius condition for [a, b]-factors
    Wei, Jia
    Zhang, Shenggui
    DISCRETE MATHEMATICS, 2023, 346 (03)
  • [36] Parity and strong parity edge-colorings of graphs
    Hsiang-Chun Hsu
    Gerard J. Chang
    Journal of Combinatorial Optimization, 2012, 24 : 427 - 436
  • [37] Parity and strong parity edge-colorings of graphs
    Hsu, Hsiang-Chun
    Chang, Gerard J.
    JOURNAL OF COMBINATORIAL OPTIMIZATION, 2012, 24 (04) : 427 - 436
  • [38] NUMBER OF PARITY SETS IN A GRAPH
    LITTLE, CHC
    CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1976, 28 (06): : 1167 - 1171
  • [39] Parity in graph sharing games
    Micek, Piotr
    Walczak, Bartosz
    DISCRETE MATHEMATICS, 2012, 312 (10) : 1788 - 1795
  • [40] Graph construction with condition-based weights for spectral clustering of hierarchical datasets
    Papp, David
    Knoll, Zsolt
    Szucs, Gabor
    INFOCOMMUNICATIONS JOURNAL, 2020, 12 (02): : 34 - 40
12345