| 一类1-边可删的导出匹配可扩图的刻画 |
| |
| 引用本文： | 周素静,王秀梅.一类1-边可删的导出匹配可扩图的刻画[J].河南师范大学学报(自然科学版),2007,35(3):21-23. |
| |
| 作者姓名： | 周素静 王秀梅 |
| |
| 作者单位： | 1. 郑州铁路职业技术学院,郑州,450052
2. 郑州大学,数学系,郑州,450052 |
| |
| 摘 要： | 设图G是有2n个顶点的简单图,如果删去G的任意k条边后得到的图是导出匹配可扩的,则称G是k-边可删的导出匹配可扩图.给出了4-正则、不包含K1,4作为导出子图、1-边可删的导出匹配可扩图的完全刻画.
|
| 关 键 词： | 导出匹配 导出匹配可扩 1-边可删的导出匹配可扩图 |
| 文章编号： | 1000-2367（2007）03-0021-03 |
| 修稿时间： | 2006-06-28 |
The Characterization of 1-edge Deletable IM-extendable Graphs |
| |
| ZHOU Su-jing,WANG Xiu-mei.The Characterization of 1-edge Deletable IM-extendable Graphs[J].Journal of Henan Normal University(Natural Science),2007,35(3):21-23. |
| |
| Authors: | ZHOU Su-jing WANG Xiu-mei |
| |
| Institution: | 1. Zhengzhou Railway Vocational and Technical College, Zhengzhou 450052,China;2. Department of Mathematics Zhengzhou University,Zhengzhou 450052,China |
| |
| Abstract: | Let G be a simple graph with |V(G)|=2n.G is called a k-edge deletable IM-extendable graph,if,for every F■E(G) with |F|=k,G-F is IM-extendable.The result that C26 is the only 4-regular and K1,4-free 1-edge deletable IM-extendable graph is obtained in this paper.The result is of great importance to further study of IM-extendability. |
| |
| Keywords: | Induced matching IM-extendable 1-edge-deletable IM-extendable graphs |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
