| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513626 | Discrete Mathematics | 2005 | 7 Pages |
Abstract
The maximum matching graph M(G) of a graph G is a graph whose vertices are maximum matchings of G and where two maximum matchings are adjacent in M(G) if they differ in exactly one edge. In this paper, the author characterizes the graphs whose maximum matching graphs are regular or cycles, and adds trees to the list of known maximum matching graphs.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Yan Liu,