The minimum number of vertices and edges of connected graphs with ind-match$(G)=p$, min-match$(G)=q$ and match$(G)=r$

Kazunori Matsuda, Ryosuke Sato, Yuichi Yoshida

Let ind-match$(G)$, min-match$(G)$ and match$(G)$ denote the induced matching number, minimum matching number and matching number of a graph $G$, respectively. It is known that ind…