Paired-domination

@article{S1998,
abstract = {We are interested in dominating sets (of vertices) with the additional property that the vertices in the dominating set can be paired or matched via existing edges in the graph. This could model the situation of guards or police where each has a partner or backup. This paper will focus on those graphs in which the number of matched pairs of a minimum dominating set of this type equals the size of some maximal matching in the graph. In particular, we characterize the leafless graphs of girth seven or more of this type.},
author = {S. Fitzpatrick, B. Hartnell},
journal = {Discussiones Mathematicae Graph Theory},
keywords = {domination; paired-domination; matching; dominating set; paired-dominating set},
language = {eng},
number = {1},
pages = {63-72},
title = {Paired-domination},
url = {http://eudml.org/doc/270264},
volume = {18},
year = {1998},
}

TY - JOUR
AU - S. Fitzpatrick
AU - B. Hartnell
TI - Paired-domination
JO - Discussiones Mathematicae Graph Theory
PY - 1998
VL - 18
IS - 1
SP - 63
EP - 72
AB - We are interested in dominating sets (of vertices) with the additional property that the vertices in the dominating set can be paired or matched via existing edges in the graph. This could model the situation of guards or police where each has a partner or backup. This paper will focus on those graphs in which the number of matched pairs of a minimum dominating set of this type equals the size of some maximal matching in the graph. In particular, we characterize the leafless graphs of girth seven or more of this type.
LA - eng
KW - domination; paired-domination; matching; dominating set; paired-dominating set
UR - http://eudml.org/doc/270264
ER -