| DEGREE CONDITIONS OF INDUCED MATCHING EXTENDABLE GRAPHS |
| |
| 作者姓名： | LiuYan YuanJinjiang WangShiying |
| |
| 作者单位： | Dept.o{SystemSci.andMath,ZhengzhouUniv,Zhengzhou450052 |
| |
| 摘 要： | Abstract. A simple graph G is induced matching extendable,shortly IM-extendable,if every in-duced matching of G is included in a perfect matching of G. The degree conditions of IM-extend-able graphs are researched in this paper. The main results are as follows：
|
| 关 键 词： | 图论 可扩展性 次数 诱导匹配条件 |
| 收稿时间： | 14 May 1998 |
Degree conditions of induced matching extendable graphs |
| |
| LiuYan YuanJinjiang WangShiying.DEGREE CONDITIONS OF INDUCED MATCHING EXTENDABLE GRAPHS[J].Applied Mathematics A Journal of Chinese Universities,2000,15(1):1-6. |
| |
| Authors: | Liu Yan Yuan Jinjiang Wang Shiying |
| |
| Institution: | (1) Dept. of System Sci. and Math., Zhengzhou Univ., 450052, Zhengzhou |
| |
| Abstract: | 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 degree conditions of IM-extendable graphs are researched in this paper. The main results are as follows: (1)⌈n/3⌉ is the minimum integer δ such that every graph with minimum degree at least δ is IM-extendable, where n=|V(G)|⩾6 is even. (2)⌈(2n−2)/3⌉ is the minimum integer k such that, for k′⩾k, every k′-regular graph with vertex number n is IM-extendable, where n=|V(G)| is even, n⩾8 and n≠10. |
| |
| Keywords: | Perf-ec-tmatching inducedmatching extendable |
| 本文献已被 CNKI 维普 SpringerLink 等数据库收录！ |
