摘要
称图 G的一个匹配 M是导出的 ,如果 M是由 M所覆盖的顶点导出的子图的边集 .
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.
出处
《郑州大学学报（自然科学版）》
2000年第4期7-9,共3页
Journal of Zhengzhou University (Natural Science)
关键词
匹配
最大匹配
导出匹配
matching
maximum matching
induced matching
