一个匹配是导出匹配的条件OACSTPCD
The Conditions of a Matching Being Induced
称图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.
刘岩;李晓娟
郑州大学系统科学与数学系郑州 450052乌鲁木齐职业大学数学教研室乌鲁木齐 830000
数学
匹配最大匹配导出匹配
matchingmaximum matchinginduced matching CLC number: Document code: ArticleID:
《郑州大学学报(自然科学版)》 2000 (4)
7-9,3
评论