Abstract:In this paper we introduce the proper-coupled-domination problem. Specifically, assume that we have (disjoint) subsets S 1 , S 2 , . . . , S t of the vertex set V(G) of graph G. One seeks to find the minimum cardinality of a dominating set D with the property that D ∩ S i ≠ φ implies that S i ⊆ D for 1 ≤ i ≤ t. We focus, in particular, on a coupled-domination parameter for which each S i has cardinality at most two.
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.