  Let $r\geq 3$ be an integer and $G$ be a graph. Let $\delta(G), \Delta(G)$,
$\alpha(G)$ and $\mu(G)$ denotes minimum degree, maximum degree, independence
number and matching number of $G$, respectively. Recently, Caro, Davila and
Pepper proved $\delta(G)\alpha(G)\leq \Delta(G)\mu(G)$. Mohr and Rautenbach
characterized the extremal graphs for non-regular graphs and 3-regular graphs.
In this note, we characterize the extremal graphs for all $r$-regular graphs in
term of Gallai-Edmonds Structure Theorem, which extends Mohr and Rautenbach's
result.
