## A note on an induced subgraph characterization of domination perfect graphs

- Eglantine Camby, Fränk Plein
- Discrete Applied Mathematics
- 2017

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

- Published 2005 in Discrete Mathematics
DOI:10.1016/j.disc.2005.08.005

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