Domination Parameters of a Graph and its Complement

Wyatt J. Desormeaux, Teresa W. Haynes, and Michael A. Henning. "Domination Parameters of a Graph and its Complement." Discussiones Mathematicae Graph Theory 38.1 (2018): 203-215. <http://eudml.org/doc/288346>.

@article{WyattJ2018,
abstract = {A dominating set in a graph G is a set S of vertices such that every vertex in V (G) S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.},
author = {Wyatt J. Desormeaux, Teresa W. Haynes, Michael A. Henning},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {domination; complement; total domination; connected domination; clique domination; restrained domination},
language = {eng},
number = {1},
pages = {203-215},
title = {Domination Parameters of a Graph and its Complement},
url = {http://eudml.org/doc/288346},
volume = {38},
year = {2018},
}

TY - JOUR
AU - Wyatt J. Desormeaux
AU - Teresa W. Haynes
AU - Michael A. Henning
TI - Domination Parameters of a Graph and its Complement
JO - Discussiones Mathematicae Graph Theory
PY - 2018
VL - 38
IS - 1
SP - 203
EP - 215
AB - A dominating set in a graph G is a set S of vertices such that every vertex in V (G) S is adjacent to at least one vertex in S, and the domination number of G is the minimum cardinality of a dominating set of G. Placing constraints on a dominating set yields different domination parameters, including total, connected, restrained, and clique domination numbers. In this paper, we study relationships among domination parameters of a graph and its complement.
LA - eng
KW - domination; complement; total domination; connected domination; clique domination; restrained domination
UR - http://eudml.org/doc/288346
ER -