Distance between two vertices of maximum matching graphs (Q705048)

The maximum matching graph \({\mathcal M}(G)\) of a graph \(G\) is a graph whose vertices are the maximum matchings of \(G\), and two maximum matchings \(M\) and \(N\) of \(G\) are adjacent in \({\mathcal M}(G)\) if and only if \(| M-N| =1\). The author studies the distance between two vertices of the maximum matching graph. In particular, he gives a lower bound, and he presents a necessary and sufficient condition for graphs which achieve this bound.