| 一类二部图的几乎完美匹配数 |
| |
| 引用本文： | 刘岩,林诒勋,王世英,黄玉琴.一类二部图的几乎完美匹配数[J].数学研究,1999,32(2):151-155. |
| |
| 作者姓名： | 刘岩 林诒勋 王世英 黄玉琴 |
| |
| 作者单位： | 郑州大学数学系!郑州450052 |
| |
| 摘 要： | 图 的一个 匹配称 为几 乎完美 匹配，若 它覆 盖了一 个顶点 以外 的所有 顶点． 本文 给出具 正 Ｓｕｒｐ ｌｕ ｓ二部图有 Ｖ（ Ｇ）＋ １个几乎 完美匹配的两个 充要条件
|
| 关 键 词： | 障碍 几乎完美匹配 |
The Number of Near Perfect Matchings of A Type of Bigraphs |
| |
| Liu Yan,Lin Yixun,Wang Shiying,Huang Yuqing.The Number of Near Perfect Matchings of A Type of Bigraphs[J].Journal of Mathematical Study,1999,32(2):151-155. |
| |
| Authors: | Liu Yan Lin Yixun Wang Shiying Huang Yuqing |
| |
| Abstract: | A matching of a graph is a near perfect matching if it covers all but one vertex. In this paper, for a bigraph having positive surplus, the sufficent and necessary conditions of the graph with |V(G)| 12 near perfect matchings are obtained. |
| |
| Keywords: | Near perfect matching Surplus Barrier |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
