Graphs Isomorphic to Their Maximum Matching Graphs

被引：0
|
作者：
Yan LIUSchool of Mathematics
机构：
来源：
ActaMathematicaSinica(EnglishSeries) | 2009年 / 25卷 / 09期
关键词：
isomorphic; maximum matching graph; bipartite graph; factor-critical graph;
D O I：
暂无
中图分类号：
O157.5 [图论];
学科分类号：
070104 ;
摘要：
The maximum matching graph ?(G) of a graph G is a simple graph whose vertices arethe maximum matchings of G and where two maximum matchings are adjacent in ?(G) if they differby exactly one edge.In this paper,we prove that if a graph is isomorphic to its maximum matchinggraph,then every block of the graph is an odd cycle.
引用
收藏
页码：1507 / 1516
页数：10
相关论文
共 50 条
12345