A spectral condition for a graph to have strong parity factors

IF 1 3区 数学 Q3 MATHEMATICS, APPLIED Discrete Applied Mathematics Pub Date : 2024-09-13 DOI:10.1016/j.dam.2024.09.003
Sizhong Zhou , Tao Zhang , Qiuxiang Bian
{"title":"A spectral condition for a graph to have strong parity factors","authors":"Sizhong Zhou ,&nbsp;Tao Zhang ,&nbsp;Qiuxiang Bian","doi":"10.1016/j.dam.2024.09.003","DOIUrl":null,"url":null,"abstract":"<div><p>A graph <span><math><mi>G</mi></math></span> has the strong parity property if for every subset <span><math><mrow><mi>X</mi><mo>⊆</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow></mrow></math></span> with <span><math><mrow><mo>|</mo><mi>X</mi><mo>|</mo></mrow></math></span> even, <span><math><mi>G</mi></math></span> has a spanning subgraph <span><math><mi>F</mi></math></span> satisfying <span><math><mrow><mi>δ</mi><mrow><mo>(</mo><mi>F</mi><mo>)</mo></mrow><mo>≥</mo><mn>1</mn></mrow></math></span>, <span><math><mrow><msub><mrow><mi>d</mi></mrow><mrow><mi>F</mi></mrow></msub><mrow><mo>(</mo><mi>u</mi><mo>)</mo></mrow><mo>≡</mo><mn>1</mn></mrow></math></span> (mod 2) for any <span><math><mrow><mi>u</mi><mo>∈</mo><mi>X</mi></mrow></math></span>, and <span><math><mrow><msub><mrow><mi>d</mi></mrow><mrow><mi>F</mi></mrow></msub><mrow><mo>(</mo><mi>v</mi><mo>)</mo></mrow><mo>≡</mo><mn>0</mn></mrow></math></span> (mod 2) for any <span><math><mrow><mi>v</mi><mo>∈</mo><mi>V</mi><mrow><mo>(</mo><mi>G</mi><mo>)</mo></mrow><mo>∖</mo><mi>X</mi></mrow></math></span>. In this paper, we give a spectral radius condition to guarantee that a connected graph has the strong parity property.</p></div>","PeriodicalId":50573,"journal":{"name":"Discrete Applied Mathematics","volume":"360 ","pages":"Pages 188-195"},"PeriodicalIF":1.0000,"publicationDate":"2024-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Applied Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0166218X24003925","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q3","JCRName":"MATHEMATICS, APPLIED","Score":null,"Total":0}
引用次数: 0

Abstract

A graph G has the strong parity property if for every subset XV(G) with |X| even, G has a spanning subgraph F satisfying δ(F)1, dF(u)1 (mod 2) for any uX, and dF(v)0 (mod 2) for any vV(G)X. In this paper, we give a spectral radius condition to guarantee that a connected graph has the strong parity property.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
图形具有强奇偶因子的谱条件
如果对于 |X| 偶数的每个子集 X⊆V(G),G 有一个跨子图 F,满足 δ(F)≥1,对于任意 u∈X 的 dF(u)≡1(mod 2),以及对于任意 v∈V(G)∖X 的 dF(v)≡0(mod 2),则图 G 具有强奇偶性。本文给出了一个谱半径条件,以保证连通图具有强奇偶性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Discrete Applied Mathematics
Discrete Applied Mathematics 数学-应用数学
CiteScore
2.30
自引率
9.10%
发文量
422
审稿时长
4.5 months
期刊介绍: The aim of Discrete Applied Mathematics is to bring together research papers in different areas of algorithmic and applicable discrete mathematics as well as applications of combinatorial mathematics to informatics and various areas of science and technology. Contributions presented to the journal can be research papers, short notes, surveys, and possibly research problems. The "Communications" section will be devoted to the fastest possible publication of recent research results that are checked and recommended for publication by a member of the Editorial Board. The journal will also publish a limited number of book announcements as well as proceedings of conferences. These proceedings will be fully refereed and adhere to the normal standards of the journal. Potential authors are advised to view the journal and the open calls-for-papers of special issues before submitting their manuscripts. Only high-quality, original work that is within the scope of the journal or the targeted special issue will be considered.
期刊最新文献
Multiplicity of signless Laplacian eigenvalue 2 of a connected graph with a perfect matching Rainbow short linear forests in edge-colored complete graph Resistance distances in generalized join graphs Partitions of Zm with identical representation functions Complexity of Maker–Breaker games on edge sets of graphs
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1