On the Maximum Matching Graph of a Graph
W Shiying · Or Transactions · 1998
Let G be a simple graph and Μ= {M: M is a maximum matching of G}. We define a new graph Μ(G) with point set Μ and line set {M1M2:|M1\M2|= 1, M1, M2∈Μ}. Μ(G) is called the maximum matching graph with respect to G. In this paper,we study the properties of Μ(G).