摘要
如果简单图G的每一个导出匹配都包含在它的一个完美匹配中 ,称图G是导出匹配可扩的 ,简称为IM 可扩的 .研究了直径为 2的无爪图的导出匹配性 ,证明了一个直径为 2的无爪图G是IM 可扩的充分必要条件是 :对任意满足 |M|≤ 3的导出匹配M ,G -V(M)没有奇分支 .因而 ,直径为 2的无爪图的IM
A simple graph G is induced matching extendable,shortly IM-extendable,if every induced matching of G is included in a perfect matching of G.The induced matching extendability of claw-free graphs of diameter 2 is studied.It is shown that a claw-free graph G of diameter 2 is IM-extendable if and only if,for any induced matching M with ｜M｜≤3 of G,G-V(M) has no odd component.Consequently,the IM-extendability problem of claw-free graphs of diameter 2 is polynomially solvable.
出处
《郑州大学学报（理学版）》
CAS
2003年第3期12-15,共4页
Journal of Zhengzhou University:Natural Science Edition
