Graphs isomorphic to their maximum matching graphs

被引：2
|
作者：
Liu, Yan [1 ]
Yan, Gui Ying [2 ]
机构：
[1] S China Normal Univ, Sch Math, Guangzhou 510631, Guangdong, Peoples R China
[2] Chinese Acad Sci, Acad Math & Syst Sci, Beijing 100190, Peoples R China
来源：
ACTA MATHEMATICA SINICA-ENGLISH SERIES | 2009年 / 25卷 / 09期
关键词：
isomorphic; maximum matching graph; bipartite graph; factor-critical graph; PERFECT MATCHINGS; ENUMERATION;
D O I：
10.1007/s10114-009-7676-8
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
The maximum matching graph a"(3)(G) of a graph G is a simple graph whose vertices are the maximum matchings of G and where two maximum matchings are adjacent in a"(3)(G) if they differ by exactly one edge. In this paper, we prove that if a graph is isomorphic to its maximum matching graph, then every block of the graph is an odd cycle.
引用
收藏
页码：1507 / 1516
页数：10
相关论文
共 50 条
12345