Remarks about disjoint dominating sets

@article{Henning2009RemarksAD,
  title={Remarks about disjoint dominating sets},
  author={Michael A. Henning and Christian L{\"o}wenstein and Dieter Rautenbach},
  journal={Discrete Mathematics},
  year={2009},
  volume={309},
  pages={6451-6458}
}
We solve a number of problems posed by Hedetniemi, Hedetniemi, Laskar, Markus, and Slater concerning pairs of disjoint sets in graphs which are dominating or independent and dominating. 

From This Paper

Figures, tables, and topics from this paper.

Explore Further: Topics Discussed in This Paper

References

Publications referenced by this paper.
Showing 1-10 of 13 references

Disjoint dominating sets in graphs

S. M. Hedetniemi, S. T. Hedetniemi, R. C. Laskar, L. Markus, P. J. Slater
Manuscript • 2007
View 10 Excerpts
Highly Influenced

Inverse domination in graphs

V. R. Kulli, S. C. Sigarkanti
Nat. Acad. Sci. Lett. 14 • 1991
View 3 Excerpts

A constructive characterization of trees with two disjoint minimum dominating sets

D. W. Bange, A. E. Barkauskas, P. J. Slater
Congressus Numerantium 21 • 1978
View 1 Excerpt

Similar Papers

Loading similar papers…