具有|V(G)|+2个最大匹配的因子临界图G

数学物理学报 ›› 2009, Vol. 29 ›› Issue (2): 486-493.

具有|V(G)|+2个最大匹配的因子临界图G

(华南师范大学数学科学学院广州 510631); (广东工业大学华立学院广州 510000)

收稿日期:2007-12-30 修回日期:2008-12-27 出版日期:2009-04-25 发布日期:2009-04-25
基金资助:
教育部博士点基金(20070574006)与国家自然科学基金(10201019)资助

Factor-critical Graph G with |V(G)|+2} Maximum Matchings

(Department of Mathematics, South China Normal University, Guangzhou 510631)；(Huali School, Guangdong University of Technology, Guangzhou 510631)

Received:2007-12-30 Revised:2008-12-27 Online:2009-04-25 Published:2009-04-25
Supported by:
教育部博士点基金(20070574006)与国家自然科学基金(10201019)资助

摘要/Abstract

摘要：

在连通图G 中, 如果对任意的 v ∈V(G), G - v 有完美匹配, 则称G是因子临界图. 该文刻画了具有|V(G)|+2个最大匹配的因子临界图. 进而, 刻画了一些特殊的双因子临界图.

关键词: 最大匹配, 因子临界图, 双临界图

Abstract:

A connected graph G is said to be factor-critical if G-v has a perfect matching for every vertex v of G.
In this paper, the factor-critical graph G with |V(G)|+2 maximum matchings is characterized. By this, some special
bicritical graphs are characterized.

Key words: Maximum matching, Factor-critical graph, Bicritical graph

中图分类号:

05C47

刘岩; 杨春侠. 具有|V(G)|+2个最大匹配的因子临界图G[J]. 数学物理学报, 2009, 29(2): 486-493.

Liu Yan；Yang Chunxia. Factor-critical Graph G with |V(G)|+2} Maximum Matchings[J]. Acta mathematica scientia,Series A, 2009, 29(2): 486-493.