Some Results on Dominating Induced Matchings

Saieed Akbari, Hossein Baktash, Amin Behjati +2

Let $G$ be a graph, a dominating induced matching (DIM) of $G$ is an induced matching that dominates every edge of $G$. In this paper we show that if a graph $G$ has a DIM, then $χ…