Disjoint dominating and 2-dominating sets in graphs

Autor:	Miotk, Mateusz, Topp, Jerzy, Żyliński, Paweł
Rok vydání:	2019
Předmět:	Mathematics - Combinatorics 05C69 05c85
Druh dokumentu:	Working Paper
Popis:	A graph $G$ is a $D\!D_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 $D\!D_2$-graphs. Comment: 15 pages, 3 figures
Databáze:	arXiv
Externí odkaz:	http://arxiv.org/abs/1903.06129 Zobrazit plný text záznamu View this record from Arxiv