Perfect graphs of strong domination and independent strong domination
(2001)
Journal Article
Let γ(G), i(G), γs(G) and is(G) denote the domination number, the independent domination number, the strong domination number and the independent strong domination number of a graph G, respectively. A graph G is called γi-perfect (domination perfect)... Read More about Perfect graphs of strong domination and independent strong domination.