Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree

Junfeng Du; Ziwen Huang; Liming Xiong

doi:10.3390/axioms11050219

Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree

Junfeng Du
, Ziwen Huang
, Liming Xiong^*

^*此作品的通讯作者

数学学院

Beijing Institute of Technology
Beijing University of Chemical Technology
Yichun University

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

2 引用（Scopus）

摘要

Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H ∈ H. In this article, we characterize all connected subgraph pairs {R, S} guranteeing the edge-connectivity of a connected {R, S}-free graph to have the same minimum degree. Our result is a supplement of Wang et al. Furthermore, we obtain a relationship of forbidden sets when those general parameters have the recurrence relation.

源语言	英语
文章编号	219
期刊	Axioms
卷	11
期	5
DOI	https://doi.org/10.3390/axioms11050219
出版状态	已出版 - 5月 2022

访问文件

10.3390/axioms11050219

其它文件与链接

链接到 Scopus 的出版物

引用此

@article{199931f94e384722b2a81377d5443a93,

title = "Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree",

abstract = "Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H ∈ H. In this article, we characterize all connected subgraph pairs \{R, S\} guranteeing the edge-connectivity of a connected \{R, S\}-free graph to have the same minimum degree. Our result is a supplement of Wang et al. Furthermore, we obtain a relationship of forbidden sets when those general parameters have the recurrence relation.",

keywords = "edge-connectivity, forbidden subgraph, minimum degree, parameter",

author = "Junfeng Du and Ziwen Huang and Liming Xiong",

note = "Publisher Copyright: {\textcopyright} 2022 by the authors. Licensee MDPI, Basel, Switzerland.",

year = "2022",

month = may,

doi = "10.3390/axioms11050219",

language = "English",

volume = "11",

journal = "Axioms",

issn = "2075-1680",

publisher = "Multidisciplinary Digital Publishing Institute (MDPI)",

number = "5",

}

TY - JOUR

T1 - Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree

AU - Du, Junfeng

AU - Huang, Ziwen

AU - Xiong, Liming

PY - 2022/5

Y1 - 2022/5

N2 - Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H ∈ H. In this article, we characterize all connected subgraph pairs {R, S} guranteeing the edge-connectivity of a connected {R, S}-free graph to have the same minimum degree. Our result is a supplement of Wang et al. Furthermore, we obtain a relationship of forbidden sets when those general parameters have the recurrence relation.

AB - Let H be a class of given graphs. A graph G is said to be H-free if G contains no induced copies of H for any H ∈ H. In this article, we characterize all connected subgraph pairs {R, S} guranteeing the edge-connectivity of a connected {R, S}-free graph to have the same minimum degree. Our result is a supplement of Wang et al. Furthermore, we obtain a relationship of forbidden sets when those general parameters have the recurrence relation.

KW - edge-connectivity

KW - forbidden subgraph

KW - minimum degree

KW - parameter

UR - https://www.scopus.com/pages/publications/85130213251

U2 - 10.3390/axioms11050219

DO - 10.3390/axioms11050219

M3 - Article

AN - SCOPUS:85130213251

SN - 2075-1680

VL - 11

JO - Axioms

JF - Axioms

IS - 5

M1 - 219

ER -

Characterizing Forbidden Pairs for the Edge-Connectivity of a Connected Graph to Be Its Minimum Degree

摘要

访问文件

其它文件与链接

指纹

引用此