On Graphs with Disjoint Dominating and 2-Dominating Sets
Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 1, p. 139.
Voir la notice de l'article dans European Digital Mathematics Library
A DD2-pair of a graph G is a pair (D,D2) of disjoint sets of vertices of G such that D is a dominating set and D2 is a 2-dominating set of G. Although there are infinitely many graphs that do not contain a DD2-pair, we show that every graph with minimum degree at least two has a DD2-pair. We provide a constructive characterization of trees that have a DD2-pair and show that K3,3 is the only connected graph with minimum degree at least three for which D ∪ D2 necessarily contains all vertices of the graph.
@article{DMGT_2013__33_1_268032, author = {Michael A. Henning and Douglas F. Rall}, title = {On {Graphs} with {Disjoint} {Dominating} and {2-Dominating} {Sets}}, journal = {Discussiones Mathematicae Graph Theory}, pages = {139}, publisher = {mathdoc}, volume = {33}, number = {1}, year = {2013}, zbl = {1291.05144}, language = {en}, url = {https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_268032/} }
TY - JOUR AU - Michael A. Henning AU - Douglas F. Rall TI - On Graphs with Disjoint Dominating and 2-Dominating Sets JO - Discussiones Mathematicae Graph Theory PY - 2013 SP - 139 VL - 33 IS - 1 PB - mathdoc UR - https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_268032/ LA - en ID - DMGT_2013__33_1_268032 ER -
Michael A. Henning; Douglas F. Rall. On Graphs with Disjoint Dominating and 2-Dominating Sets. Discussiones Mathematicae Graph Theory, Tome 33 (2013) no. 1, p. 139. https://geodesic-test.mathdoc.fr/item/DMGT_2013__33_1_268032/