Cographic and Global Cographic Domination Number of a Graph

Abstract

In this paper, we prove that for any graph $G$, there is a dominating induced subgraph which is a cograph. Two new domination parameters ${\gamma }_{cd}$ – the cographic domination number and ${\gamma }_{gcd}$ – the global cographic domination number are defined. Some properties, including complexity aspects, are discussed.