A dominating set of a graph G = (V, E) is a subset D of V such that every vertex of V − D is adjacent to a vertex in D. In this paper we introduce a generalization of domination as follows. For graphs G and H, an H-matching M of G is a subgraph of G such that all components of M are isomorphic to H. An H-dominating matching of G is a H-matching D of G such… (More)
A subset Q ⊆ V (G) is a dominating set of a graph G if each vertex in V (G) is either in Q or is adjacent to a vertex in Q. A dominating set Q of G is minimal if Q contains no dominating set of G as a proper subset. In this paper we study the number of minimal dominating sets in some classes of trees.