2019
DOI: 10.48550/arxiv.1903.06129
|View full text |Cite
Preprint
|
Sign up to set email alerts
|

Disjoint dominating and 2-dominating sets in graphs

Abstract: A graph G is a DD 2 -graph if it has a pair (D, D 2 ) of disjoint sets of vertices of G such that D is a dominating set and D 2 is a 2-dominating set of G. We provide several characterizations and hardness results concerning DD 2 -graphs.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

0
0
0

Publication Types

Select...

Relationship

0
0

Authors

Journals

citations
Cited by 0 publications
references
References 21 publications
0
0
0
Order By: Relevance

No citations

Set email alert for when this publication receives citations?