Sufficient conditions for graphs to have strong parity factors

IF 1.8 4区管理学 Q3 OPERATIONS RESEARCH & MANAGEMENT SCIENCE Rairo-Operations Research Pub Date : 2023-09-01 DOI:10.1051/ro/2023147

Sizhong Zhou, Yuli Zhang

引用次数: 0

Abstract

A graph G has a strong parity factor F if for every subset X ⊆ V ( G ) with | X | even, G contains a spanning subgraph F such that δ ( F ) ≥ 1, d F ( u ) ≡ 1 (mod 2) for any u ∈ X , and d F ( v ) ≡ 0 (mod 2) for any v ∈ V ( G ) \ X . In this article, we first provide a size condition for a graph having a strong parity factor. Then we put forward a toughness condition to guarantee that a graph has a strong parity factor.

查看原文

微信好友朋友圈 QQ好友复制链接

本刊更多论文

图具有强宇称因子的充分条件

图G有一个强宇称因子F，如果对每一个子集X V (G)有| × |偶，G包含一个生成子图F，使得δ (F)≥1，对于任意u∈X, F (u)≡1 (mod 2)，对于任意V∈V (G) \ X, F (V)≡0 (mod 2)。在本文中，我们首先提供了具有强奇偶因子的图的大小条件。然后给出了保证图具有强宇称因子的一个韧性条件。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文去求助

来源期刊

Rairo-Operations Research 管理科学-运筹学与管理科学

CiteScore

3.60

自引率

22.20%

发文量

206

审稿时长

>12 weeks

期刊介绍： RAIRO-Operations Research is an international journal devoted to high-level pure and applied research on all aspects of operations research. All papers published in RAIRO-Operations Research are critically refereed according to international standards. Any paper will either be accepted (possibly with minor revisions) either submitted to another evaluation (after a major revision) or rejected. Every effort will be made by the Editorial Board to ensure a first answer concerning a submitted paper within three months, and a final decision in a period of time not exceeding six months.