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.
@article{bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1063,
author = {S. Fitzpatrick and B. Hartnell},
title = {Paired-domination},
journal = {Discussiones Mathematicae Graph Theory},
volume = {18},
year = {1998},
pages = {63-72},
zbl = {0916.05061},
language = {en},
url = {http://dml.mathdoc.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1063}
}
S. Fitzpatrick; B. Hartnell. Paired-domination. Discussiones Mathematicae Graph Theory, Tome 18 (1998) pp. 63-72. http://gdmltest.u-ga.fr/item/bwmeta1.element.bwnjournal-article-doi-10_7151_dmgt_1063/
[000] [1] T.W. Haynes and P.J. Slater, Paired-domination in graphs, submitted for publication. | Zbl 0997.05074
[001] [2] T.W. Haynes and P.J. Slater, Paired-domination and the paired-domatic number, Congressus Numerantium 109 (1995) 65-72. | Zbl 0904.05052