步长为1和(2n+1)/3的2n阶循环图的导出匹配可扩性  

The Induced Matching Extendability of Cyclic Graph with 2n Vertices and Step Length 1 and (2n+1)/3

作　　者：徐华锋[1] 王晓凤[1] 

机构地区：[1]平顶山工学院,河南平顶山467001

出　　处：《河南大学学报（自然科学版）》2006年第3期12-14,共3页Journal of Henan University:Natural Science

摘　　要：根据原晋江在《导出匹配可扩图》一文中给出的图的导出匹配可扩性的概念,采用把图的任意匹配扩充为完美匹配的方法,研究了步长为1和(2n+1)/3的2n阶循环图的导出匹配可扩性,得出主要结论为:当n≥4时,步长为1和(2n+1)/3的2n阶循环图是导出匹配可扩的.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.

关 键 词：导出匹配 完美匹配 可扩的 循环图 

分 类 号：O157.5[理学—数学]