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 条
  • [21] More sufficient conditions for a graph to have factors
    Anstee, RP
    Nam, Y
    DISCRETE MATHEMATICS, 1998, 184 (1-3) : 15 - 24
  • [22] The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
    Sarah Allred
    Emelie Curl
    Shaun Fallat
    Shahla Nasserasr
    Houston Schuerger
    Ralihe R. Villagrán
    Prateek K. Vishwakarma
    Graphs and Combinatorics, 2024, 40
  • [23] The Strong Spectral Property of Graphs: Graph Operations and Barbell Partitions
    Allred, Sarah
    Curl, Emelie
    Fallat, Shaun
    Nasserasr, Shahla
    Schuerger, Houston
    Villagran, Ralihe R.
    Vishwakarma, Prateek K.
    GRAPHS AND COMBINATORICS, 2024, 40 (02)
  • [24] On neighborhood condition for graphs to have [a,b]-factors
    Li, JX
    DISCRETE MATHEMATICS, 2003, 260 (1-3) : 217 - 221
  • [25] A neighborhood condition for graphs to have [a,b]-factors
    Matsuda, H
    DISCRETE MATHEMATICS, 2000, 224 (1-3) : 289 - 292
  • [26] Graph Decomposition and Parity
    DeMarco, Bobby
    Redlich, Amanda
    JOURNAL OF GRAPH THEORY, 2016, 82 (04) : 374 - 386
  • [27] The Chvátal–Erdős Condition for a Graph to Have a Spanning Trail
    Runli Tian
    Liming Xiong
    Graphs and Combinatorics, 2015, 31 : 1739 - 1754
  • [28] A sufficient Q -spectral condition for a graph to be β-deficient involving minimum degree
    Liu, Weijun
    Huang, Zheng
    Li, Yongtao
    Feng, Lihua
    DISCRETE APPLIED MATHEMATICS, 2019, 265 : 158 - 167
  • [29] A Neighborhood Condition for Graphs to Have [a, b]-Factors II
    Haruhide Matsuda
    Graphs and Combinatorics, 2002, 18 : 763 - 768
  • [30] A Neighborhood Condition for Graphs to Have (g, f)-Factors
    Liu, Hongxia
    Liu, Guizhen
    ARS COMBINATORIA, 2009, 93 : 257 - 264
12345