Matchings and Path Covers with applications to Domination in Graphs

Michael A. Henning, Kirsti Wash

Let $G$ be a graph with no isolated vertex. A matching in $G$ is a set of edges that are pairwise not adjacent in $G$, while the matching number, ${\alpha }^{\prime }(G)$, of $G$ is the maximum siz…