THE CONNECTIVITY OF MAXIMUM MATCHING GRAPHS  

作　　者：LIUYan WANGShiying 

机构地区：[1]DepartmentofMathematics,SouthChinaNormalUniversity,Guangzhou510631,China [2]DepartmentofMathematics,ShanxiUniversity,Taiyuan030000,China

出　　处：《Journal of Systems Science & Complexity》2004年第1期33-38,共6页系统科学与复杂性学报（英文版）

基　　金：This research is suppouted by the National Natural Science Foundation of China(10201019)

摘　　要：The maximum matching graph of a graph has a vertex for each maximummatching and an edge for each pair of maximum matchings which differ by exactly oneedge. In this paper, we prove that the connectivity of maximum matching graph of abipartite graph is equal to its minimum degree.

关 键 词：maximum matching graph CONNECTIVITY 

分 类 号：O157.5[理学—数学]