Perfect graphs of strong domination and independent strong domination

Abstract

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) if γ(H) = i(H), for every induced subgraph H of G. The classes of γγS-perfect, γSiS-perfect, iiS-perfect and… (More)
DOI: 10.1016/S0012-365X(00)00116-3

3 Figures and Tables

Topics

  • Presentations referencing similar topics