The Induced Matching Extendibility of some Graphs in Cyclic Graph
Xiao‐Dong Zhang · He'nan kexue · 2008
A simple graph G is called as the induced matching extendable,if any induced matching of G can be included in a perfect matching of G.The cyclic graph which step length is 1 and k,denoted by C2n(1,k),is the graph with 2n vertices x1,x2,…,x2n,such that xixj is an edge of C2n(1,k) if either i-j ≡ ±1(mod 2n)or i-j ≡± k(mod 2n).In this paper the induced matching extendibility of cyclic graph is discussed.We give the IM-extendablity of some graphs in cyclic graphs.