Unique irredundance, domination and independent domination in graphs

@article{Fischermann2005UniqueID,
  title={Unique irredundance, domination and independent domination in graphs},
  author={Miranca Fischermann and Lutz Volkmann and Igor E. Zverovich},
  journal={Discrete Mathematics},
  year={2005},
  volume={305},
  pages={190-200}
}
A subset D of the vertex set of a graph G is irredundant if every vertex v in D has a private neighbor with respect to D, i.e. either v has a neighbor in V (G)\D that has no other neighbor in D besides v or v itself has no neighbor in D. An irredundant set D is maximal irredundant if D ∪{v} is not irredundant for any vertex v ∈ V (G)\D. A set D of vertices in a graph G is a minimal dominating set of G if D is irredundant and every vertex in V (G)\D has at least one neighbor in D. A subset I of… CONTINUE READING

References

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

A characterization of

  • E. J. Cockayne, O. Favaron, C. M. Mynhart, J. Puech
  • i)-trees, J. Graph Theory 34 (4)
  • 2000
1 Excerpt

Fundamentals of domination in graphs, Monographs and Textbooks

  • T. W. Haynes, S. T. Hedetniemi, P. J. Slater
  • Pure and Applied Mathematics,
  • 1998
1 Excerpt

Domination , independence and irredundance in graphs

  • L. Volkmann J. Topp
  • Diss . Math .
  • 1995

Similar Papers

Loading similar papers…