Independent domination and matchings in graphs

If G is a graph of order n, independent domination number i and matching number α0, then i+α0⩽n. We characterize all graphs for which equality holds in this inequality and show that this class can be recognized in polynomial time.