Independent domination in graphs: A survey and recent results

@article{Goddard2013IndependentDI,
  title={Independent domination in graphs: A survey and recent results},
  author={Wayne Goddard and Michael A. Henning},
  journal={Discrete Mathematics},
  year={2013},
  volume={313},
  pages={839-854}
}
A set S of vertices in a graph G is an independent dominating set of G if S is an independent set and every vertex not in S is adjacent to a vertex in S. In this paper, we offer a survey of selected recent results on independent domination in graphs. 
18 Citations
116 References
Similar Papers

References

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

Bounds for the independent domination number of graphs and planar graphs

  • G. MacGillivray, K. Seyffarth
  • J. Combin. Math. Combin. Comput., 49:33–55,
  • 2004
Highly Influential
7 Excerpts

Domination perfect graphs

  • D. P. Sumner, J. L. Moore
  • Notice Amer. Math. Soc., 26:A–569,
  • 1979
Highly Influential
4 Excerpts

Bounds on an independent distance domination parameter

  • J. Gimbel, M. A. Henning
  • J. Combin. Comput. Combin. Math., 20:193–205,
  • 1996
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…