2019/03/14 by Miotk, Mateusz, Topp, Jerzy, Żyliński, Paweł
#05C69 #05c85 #Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1903.06129
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.