Geodesic
Paired-domination
Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 1, pp. 63-72.

Voir la notice de l'article provenant de la source Library of Science

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.
Keywords: domination, paired-domination, matching 
@article{DMGT_1998_18_1_a4,
     author = {Fitzpatrick, S. and Hartnell, B.},
     title = {Paired-domination},
     journal = {Discussiones Mathematicae. Graph Theory},
     pages = {63--72},
     publisher = {mathdoc},
     volume = {18},
     number = {1},
     year = {1998},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a4/}
}
TY  - JOUR
AU  - Fitzpatrick, S.
AU  - Hartnell, B.
TI  - Paired-domination
JO  - Discussiones Mathematicae. Graph Theory
PY  - 1998
SP  - 63
EP  - 72
VL  - 18
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a4/
LA  - en
ID  - DMGT_1998_18_1_a4
ER  - 
%0 Journal Article
%A Fitzpatrick, S.
%A Hartnell, B.
%T Paired-domination
%J Discussiones Mathematicae. Graph Theory
%D 1998
%P 63-72
%V 18
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a4/
%G en
%F DMGT_1998_18_1_a4
Fitzpatrick, S.; Hartnell, B. Paired-domination. Discussiones Mathematicae. Graph Theory, Tome 18 (1998) no. 1, pp. 63-72. http://geodesic.mathdoc.fr/item/DMGT_1998_18_1_a4/

[1] T.W. Haynes and P.J. Slater, Paired-domination in graphs, submitted for publication.

[2] T.W. Haynes and P.J. Slater, Paired-domination and the paired-domatic number, Congressus Numerantium 109 (1995) 65-72.