On \(H\)-dominating matchings and some number partitions (Q2848718)

For graphs \(G\) and \(H\), an H-matching of \(G\) is a subgraph of \(G\) such that all of its components are isomorphic to \(H\). An \(H\)-dominating matching of \(G\) is an \(H\)-matching \(D\) such that for each vertex \(x\) of \(G\) there exists a vertex \(y\) in \(D\) such that the edge \((x, y)\) is in \(G\). Let \(P(n)\) denote the path on \(n\) vertices numbered in the natural order and let \(C(n)\) be a cycle on \(n\) vertices. The paper considers \(P(k)\)-dominating matchings for \(k > 0\), and generalizes the recent results on the number of dominating sets for the graphs \(P(n)\) and \(C(n)\).