| 关于偶匹配可扩图中删去两个点(英文) |
| |
| 引用本文： | 王秀梅,董云达,林诒勋.关于偶匹配可扩图中删去两个点(英文)[J].河南科学,2007,25(3):361-363. |
| |
| 作者姓名： | 王秀梅 董云达 林诒勋 |
| |
| 作者单位： | 郑州大学,数学系,郑州,450052 |
| |
| 摘 要： | 设G是含有完美匹配的简单图.称G是偶匹配可扩的,如果G中导出子图是偶图的匹配M都可以扩充为G的完美匹配.研究了在偶匹配可扩图中删去两个顶点后该图的性质.这些性质对于偶匹配可扩图的进一步研究会有帮助.
|
| 关 键 词： | 匹配 偶匹配 偶匹配可扩 |
| 文章编号： | 1004-3918(2007)03-0361-03 |
| 修稿时间： | 2006-12-13 |
On Two-Vertex Deletion in Bipartite Matching Extendable Graphs |
| |
| WANG Xiu-mei,DONG Yun-da,LIN Yi-xun.On Two-Vertex Deletion in Bipartite Matching Extendable Graphs[J].Henan Science,2007,25(3):361-363. |
| |
| Authors: | WANG Xiu-mei DONG Yun-da LIN Yi-xun |
| |
| Institution: | Department of Mathematics, Zhengzhou University, Zhengzhou 450052, China |
| |
| Abstract: | Let G be a simple graph containing a perfect matching.G is said to be bipartite matching extendable(BM-extendable) if every matching M whose induced subgraph is a bipartite graph extends to a perfect matching of G.In this paper,we present some properties of BM-extendable graphs after deleting two distinct vertices.They will be useful for further study of BM-extendability. |
| |
| Keywords: | matching bipartite matching bipartite matching extendable |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
