On Total Domination and Minimum Maximal Matchings in Graphs

Selim Bahadır

A subset $M$ of the edges of a graph $G$ is a matching if no two edges in $M$ are incident. A maximal matching is a matching that is not contained in a larger matching. A subset $S…