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-match$(G) \leq $ min-match$(G) \leq {\rm match}(G) \leq$ 2min-match$(G)$ holds. In the present paper, we investigate the minimum number of vertices and edges of connencted simple graphs $G$ with ind-match$(G) = p$, min-match$(G) = q$ and ${\rm match}(G) = r$ for pair of integers $p, q, r$ such that $1 \leq p \leq q \leq r \leq 2q$.