Matching Extendabilities of G = Cm V Pn

Zhi hao Hui; Yu Yang; Hua Wang; Xiao jun Sun

doi:10.3390/math7100941

Matching Extendabilities of G = C_m V P_n

Zhi hao Hui, Yu Yang, Hua Wang, Xiao jun Sun

Mathematical Sciences

Research output: Contribution to journal › Article › peer-review

1 Scopus citations

Abstract

A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of G is included in a perfect matching of G. The induced-matching extendability and bipartite-matching extendability of graphs have been of interest. By letting G = C_m V P_n (m ≥ 3 and n ≥ 1) be the graph join of C_m (the cycle with m vertices) and P_n (the path with n vertices) contains a perfect matching, we find necessary and sufficient conditions for G to be induced-matching extendable and bipartite-matching extendable.

Original language	English
Article number	941
Journal	Mathematics
Volume	7
Issue number	10
DOIs	https://doi.org/10.3390/math7100941
State	Published - Oct 1 2019

Scopus Subject Areas

General Mathematics

Keywords

Bipartite matching extendable graph
Induced matching extendable
k-extendable
Perfect matching

Access to Document

10.3390/math7100941

Cite this

@article{daf7c12b28934cabb5893defce28eba7,

title = "Matching Extendabilities of G = Cm V Pn",

abstract = "A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of G is included in a perfect matching of G. The induced-matching extendability and bipartite-matching extendability of graphs have been of interest. By letting G = Cm V Pn (m ≥ 3 and n ≥ 1) be the graph join of Cm (the cycle with m vertices) and Pn (the path with n vertices) contains a perfect matching, we find necessary and sufficient conditions for G to be induced-matching extendable and bipartite-matching extendable.",

keywords = "Bipartite matching extendable graph, Induced matching extendable, k-extendable, Perfect matching",

author = "Hui, {Zhi hao} and Yu Yang and Hua Wang and Sun, {Xiao jun}",

note = "Publisher Copyright: {\textcopyright} 2019 by the authors.",

year = "2019",

month = oct,

day = "1",

doi = "10.3390/math7100941",

language = "English",

volume = "7",

journal = "Mathematics",

issn = "2227-7390",

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

number = "10",

}

TY - JOUR

T1 - Matching Extendabilities of G = Cm V Pn

AU - Hui, Zhi hao

AU - Yang, Yu

AU - Wang, Hua

AU - Sun, Xiao jun

PY - 2019/10/1

Y1 - 2019/10/1

N2 - A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of G is included in a perfect matching of G. The induced-matching extendability and bipartite-matching extendability of graphs have been of interest. By letting G = Cm V Pn (m ≥ 3 and n ≥ 1) be the graph join of Cm (the cycle with m vertices) and Pn (the path with n vertices) contains a perfect matching, we find necessary and sufficient conditions for G to be induced-matching extendable and bipartite-matching extendable.

AB - A graph is considered to be induced-matching extendable (bipartite matching extendable) if every induced matching (bipartite matching) of G is included in a perfect matching of G. The induced-matching extendability and bipartite-matching extendability of graphs have been of interest. By letting G = Cm V Pn (m ≥ 3 and n ≥ 1) be the graph join of Cm (the cycle with m vertices) and Pn (the path with n vertices) contains a perfect matching, we find necessary and sufficient conditions for G to be induced-matching extendable and bipartite-matching extendable.

KW - Bipartite matching extendable graph

KW - Induced matching extendable

KW - k-extendable

KW - Perfect matching

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

U2 - 10.3390/math7100941

DO - 10.3390/math7100941

M3 - Article

AN - SCOPUS:85073699080

SN - 2227-7390

VL - 7

JO - Mathematics

JF - Mathematics

IS - 10

M1 - 941

ER -