An induced subgraph characterization of domination perfect graphs

@article{Zverovich1995AnIS,
  title={An induced subgraph characterization of domination perfect graphs},
  author={Igor E. Zverovich and Vadim E. Zverovich},
  journal={Journal of Graph Theory},
  year={1995},
  volume={20},
  pages={375-395}
}
Let y(G) and L(G) be the domination number and independent domination number of a graph G, respectively. A graph G is called domination perfect if y(H) = L(H) , for every induced subgraph H of G. There are many results giving a partial characterization of domination perfect graphs. In this paper, we present a finite induced subgraph characterization of the entire class of domination perfect graphs. The list of forbidden subgraphs in the characterization consists of 17 minimal domination… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Characterization of trees with equal domination and independent domination numbers

  • Harary, M. Livingston
  • Graph Theory
  • 1969

Similar Papers

Loading similar papers…