Induced Matching Number of the Plane GridGraph
LUXiao-xu, PEIMing, YAOWei-li, ZhouJu · 数学季刊：英文版 · 2004
An induced matching M in a graph G is a matching such that V(M) induces a1-regular subgraph of G. The induced matching number of a graph G, denoted by IM(G), isthe maximum number r such that G has an induced matching of r edges. Induced matchingnumber of Prn x Pn is investigated in this paper. The main results are as follows: