Induced claws and existence of even factors of graphs

Shengmei Lv; Liming Xiong; Guifu Su; Ning Zhao

doi:10.1007/s40840-016-0410-7

Induced claws and existence of even factors of graphs

Shengmei Lv, Liming Xiong^*, Guifu Su, Ning Zhao

^*此作品的通讯作者

数学学院

科研成果: 期刊稿件 › 文章 › 同行评审

摘要

An even factor of a graph G is a spanning subgraph in G such that the degree of each vertex is a positive even integer. In this paper, we show that for any induced claw of simple graph G of order at least 10, if there exists at least a pair of vertices out of the claw such that they are the common neighbors of nonadjacent vertices of the claw, then G has an even factor if and only if δ(G) ≥ 2 and every odd branch-bond of G contains a branch of length 1. The even factor of claw-heavy graphs was also characterized.

源语言	英语
页（从-至）	1529-1540
页数	12
期刊	Bulletin of the Malaysian Mathematical Sciences Society
卷	41
期	3
DOI	https://doi.org/10.1007/s40840-016-0410-7
出版状态	已出版 - 1 7月 2018

访问文件

10.1007/s40840-016-0410-7

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{d693a402fbd445bf8f4359653781b9ec,

title = "Induced claws and existence of even factors of graphs",

abstract = "An even factor of a graph G is a spanning subgraph in G such that the degree of each vertex is a positive even integer. In this paper, we show that for any induced claw of simple graph G of order at least 10, if there exists at least a pair of vertices out of the claw such that they are the common neighbors of nonadjacent vertices of the claw, then G has an even factor if and only if δ(G) ≥ 2 and every odd branch-bond of G contains a branch of length 1. The even factor of claw-heavy graphs was also characterized.",

keywords = "Branch-bond, Claw-heavy graph, Even factor, Even subgraph, Induced claw",

author = "Shengmei Lv and Liming Xiong and Guifu Su and Ning Zhao",

note = "Publisher Copyright: {\textcopyright} 2016, Malaysian Mathematical Sciences Society and Penerbit Universiti Sains Malaysia.",

year = "2018",

month = jul,

day = "1",

doi = "10.1007/s40840-016-0410-7",

language = "English",

volume = "41",

pages = "1529--1540",

journal = "Bulletin of the Malaysian Mathematical Sciences Society",

issn = "0126-6705",

publisher = "Springer Singapore",

number = "3",

}

TY - JOUR

T1 - Induced claws and existence of even factors of graphs

AU - Lv, Shengmei

AU - Xiong, Liming

AU - Su, Guifu

AU - Zhao, Ning

PY - 2018/7/1

Y1 - 2018/7/1

N2 - An even factor of a graph G is a spanning subgraph in G such that the degree of each vertex is a positive even integer. In this paper, we show that for any induced claw of simple graph G of order at least 10, if there exists at least a pair of vertices out of the claw such that they are the common neighbors of nonadjacent vertices of the claw, then G has an even factor if and only if δ(G) ≥ 2 and every odd branch-bond of G contains a branch of length 1. The even factor of claw-heavy graphs was also characterized.

AB - An even factor of a graph G is a spanning subgraph in G such that the degree of each vertex is a positive even integer. In this paper, we show that for any induced claw of simple graph G of order at least 10, if there exists at least a pair of vertices out of the claw such that they are the common neighbors of nonadjacent vertices of the claw, then G has an even factor if and only if δ(G) ≥ 2 and every odd branch-bond of G contains a branch of length 1. The even factor of claw-heavy graphs was also characterized.

KW - Branch-bond

KW - Claw-heavy graph

KW - Even factor

KW - Even subgraph

KW - Induced claw

UR - http://www.scopus.com/inward/record.url?scp=85049148775&partnerID=8YFLogxK

U2 - 10.1007/s40840-016-0410-7

DO - 10.1007/s40840-016-0410-7

M3 - Article

AN - SCOPUS:85049148775

SN - 0126-6705

VL - 41

SP - 1529

EP - 1540

JO - Bulletin of the Malaysian Mathematical Sciences Society

JF - Bulletin of the Malaysian Mathematical Sciences Society

IS - 3

ER -

Induced claws and existence of even factors of graphs

摘要

访问文件

其它文件与链接

指纹

引用此