| 一个匹配是导出匹配的条件 |
| |
| 引用本文： | 刘岩,李晓娟. 一个匹配是导出匹配的条件[J]. 郑州大学学报(理学版), 2000, 32(4): 7-9 |
| |
| 作者姓名： | 刘岩 李晓娟 |
| |
| 作者单位： | 1. 郑州大学系统科学与数学系郑州 450052
2. 乌鲁木齐职业大学数学教研室乌鲁木齐 830000 |
| |
| 摘 要： | 称图G的一个匹配M是导出的，如果M是由M所覆盖的顶点导出的子图的边集．分别给出二部图的一个匹配是导出匹配的条件及存在一个最大匹配是导出匹配的条件．
|
| 关 键 词： | 匹配；最大匹配；导出匹配 |
| 文章编号： | 1001-8212(2000)04-0007-03 |
| 修稿时间： | 2000-04-25 |
The Conditions of a Matching Being Induced |
| |
| LIU Yan,LI Xiao-juan. The Conditions of a Matching Being Induced[J]. Journal of Zhengzhou University(Natrual Science Edition), 2000, 32(4): 7-9 |
| |
| Authors: | LIU Yan LI Xiao-juan |
| |
| Abstract: | A matching M of graph G is said to be induced if M is the set of edges of subgraph induced by vertices which are covered by M. The conditions that a matching of bipartite graphs is induced and that there exists a maximum matching being induced are obtained, respectively. |
| |
| Keywords: | matching maximum matching induced matching CLC number Document code ArticleID |
| 本文献已被 万方数据 等数据库收录！ |
