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

Voir la notice de l'article dans European Digital Mathematics Library

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.
Classification : 05C75
Mots-clés : domination, paired-domination, matching, dominating set, paired-dominating set 
@article{DMGT_1998__18_1_270264,
     author = {S. Fitzpatrick and B. Hartnell},
     title = {Paired-domination},
     journal = {Discussiones Mathematicae Graph Theory},
     pages = {63},
     publisher = {mathdoc},
     volume = {18},
     number = {1},
     year = {1998},
     zbl = {0916.05061},
     language = {en},
     url = {https://geodesic-test.mathdoc.fr/item/DMGT_1998__18_1_270264/}
}
TY  - JOUR
AU  - S. Fitzpatrick
AU  - B. Hartnell
TI  - Paired-domination
JO  - Discussiones Mathematicae Graph Theory
PY  - 1998
SP  - 63
VL  - 18
IS  - 1
PB  - mathdoc
UR  - https://geodesic-test.mathdoc.fr/item/DMGT_1998__18_1_270264/
LA  - en
ID  - DMGT_1998__18_1_270264
ER  - 
%0 Journal Article
%A S. Fitzpatrick
%A B. Hartnell
%T Paired-domination
%J Discussiones Mathematicae Graph Theory
%D 1998
%P 63
%V 18
%N 1
%I mathdoc
%U https://geodesic-test.mathdoc.fr/item/DMGT_1998__18_1_270264/
%G en
%F DMGT_1998__18_1_270264
S. Fitzpatrick; B. Hartnell. Paired-domination. Discussiones Mathematicae Graph Theory, Tome 18 (1998) no. 1, p. 63. https://geodesic-test.mathdoc.fr/item/DMGT_1998__18_1_270264/