Characterizations of maximum matching graphs of certain types

The maximum matching graph image of a graph G is a graph whose vertices are maximum matchings of G and where two maximum matchings are adjacent in image 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.