Disjoint dominating and 2-dominating sets in graphs

From MaRDI portal
Publication:2299982




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.



Cites work







This page was built for publication: Disjoint dominating and 2-dominating sets in graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2299982)