Abstract:A set D of vertices in a graph G is said to be a dominating set if every vertex in V − D is adjacent to some vertex in D. A subset D of V is a paired-dominating set of G, if D is a dominating set and the subgraph induced by the vertices of D contains a perfect matching. A set D of a vertices in a graph G = (V, E) is said to be a total dominating set of G if every vertex in V is adjacent to some vertex in D. The total bondage number b t (G) of G is the minimum number of edges whose removal enlarges the total do… Show more
Set email alert for when this publication receives citations?
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.