Study on the Induced Matching Extendibility of Cyclic Graph with Step Length 1 and 1/2
Bin Liu · He'nan kexue · 2006
A simple graph G is called as the induced matching extendable,shortly IM-extendable,if every induced matching of G is included in a perfect matching of G.The cyclic graph with 2n vertices which step length are 1 and 1/2,denoted by C2n(1,1/2),is the graph with 2n vertices x1,x2,...,x2n,such that xi xj is an edge of C2n(1,1/2) if either i-j≡±1(mod 2n) or i-j≡±1/2(mod 2n).It is shown that C2n(1,1/2),n4 is IM-extendable.