Highly Influenced

# 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} }

- Published 2013 in Discrete Mathematics
DOI:10.1016/j.disc.2012.11.031

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.

#### From This Paper

##### Figures, tables, and topics from this paper.

18 Citations

116 References

Similar Papers

#### References

##### Publications referenced by this paper.

Showing 1-10 of 116 references

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential

Highly Influential