Matching Extendabilities of G = Cm ∨ Pn
Keyword(s):
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.
1977 ◽
Vol 29
(1)
◽
pp. 165-168
◽
1986 ◽
Vol 23
(04)
◽
pp. 851-858
◽
1991 ◽
Vol 11
(1)
◽
pp. 65-71
◽