检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者: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
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.179