The Induced Matching Extendability of Cyclic Graph with 2n Vertices and Step Length 1 and (2n+1)/3
Xiaofeng Wang · Journal of Henan University · 2006
According to the result of Induced Matching Extendable Graph by Yuan Jinjiang,Using the method expending an arbitrary matching to a perfect matching,the paper investigates the induced matching extendendability of cyclic graph with 2n Vertices and step length 1 and(2n+1)/3.The main result is that,when n≥4,the cyclic graph with 2n Vertices and step length 1 and(2n+1)/3 is IM-extendable.