Distance Between Two Vertices of Maximum Matching Graphs  

作　　者：YanLiu 

机构地区：[1]DepartmentofMathematics,SouthChinaNormalUniversity,Guangzhou,Guangdong,510631China

出　　处：《Acta Mathematicae Applicatae Sinica》2004年第4期641-646,共6页应用数学学报（英文版）

摘　　要：The maximum matching graph of a graph has a vertex for each maximum matching and an edge for each pair of maximum matchings which differ by exactly one edge. In this paper, we obtain a lower bound of distance between two vertices of maximum matching graph, and give a necessary and sufficient condition that the bound can be reached.

关 键 词：Maximum matching graph DISTANCE positive surplus 

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