Matching Extendabilities of G = C m ? P n

Zhi-hao Hui, Yu Yang, Hua Wang and Xiao-jun Sun
Additional contact information
Zhi-hao Hui: School of Mathematics and Statistics Science, Pingdingshan University, Pingdingshan 467000, China
Yu Yang: School of Computer Science, Pingdingshan University, Pingdingshan 467000, China
Hua Wang: College of Software, Nankai University, Tianjin 300071, China
Xiao-jun Sun: School of Electrical and Mechanical Engineering, Pingdingshan University, Pingdingshan 467000, China

Mathematics, 2019, vol. 7, issue 10, 1-9

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 ∨ 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.

Keywords: perfect matching; k-extendable; induced matching extendable; bipartite matching extendable graph (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
https://www.mdpi.com/2227-7390/7/10/941/pdf (application/pdf)
https://www.mdpi.com/2227-7390/7/10/941/ (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:7:y:2019:i:10:p:941-:d:275263

Access Statistics for this article

Mathematics is currently edited by Ms. Emma He

More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().