Disjoint dominating and 2-dominating sets in graphs
Abstract
A graph G is a D\!D2-graph if it has a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. We provide several characterizations and hardness results concerning D\!D2-graphs.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.