A characterization of domination perfect graphs
暂无分享,去创建一个
Let γ(G) and i(G) be the domination number and independent domination number of a graph G, respectively. Sumner and Moore [8] define a graph G to be domination perfect if γ(H) = i(H), for every induced subgraph H of G. In this article, we give a finite forbidden induced subgraph characterization of domination perfect graphs. Bollobas and Cockayne [4] proved an inequality relating γ(G) and i(G) for the class of K1,k ‐free graphs. It is shown that the same inequality holds for a wider class of graphs. Copyright © 1991 Wiley Periodicals, Inc., A Wiley Company
[1] Robert B. Allan,et al. On domination and independent domination numbers of a graph , 1978, Discret. Math..
[2] Claude Berge,et al. The theory of graphs and its applications , 1962 .
[3] H. B. Walikar,et al. On domination related concepts in Graph Theory , 1981 .
[4] Béla Bollobás,et al. Graph-theoretic parameters concerning domination, independence, and irredundance , 1979, J. Graph Theory.