| THE CONNECTIVITY OF MAXIMUM MATCHING GRAPHS |
| |
| 作者姓名： | LIUYan WANGShiying |
| |
| 作者单位： | LIU Yan
(Department of Mathematics，South China Normal University，Guangzhou 510631，China)
WANG Shiying (Department of Mathematics，Shanxi University，Taiyuan 030000，China) |
| |
| 基金项目： | 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.
|
| 关 键 词： | 连通性 最大匹配图 双向图 简单图 |
THE CONNECTIVITY OF MAXIMUM MATCHING GRAPHS |
| |
| LIUYan WANGShiying.THE CONNECTIVITY OF MAXIMUM MATCHING GRAPHS[J].Journal of Systems Science and Complexity,2004,17(1):33-38. |
| |
| Authors: | LIU Yan |
| |
| Abstract: | 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 prove that the connectivity of maximum matching graph of a bipartite graph is equal to its minimum degree. |
| |
| Keywords: | Maximum matching graph connectivity |
| 本文献已被 CNKI 维普 等数据库收录！ |
