Contents

Ars Combinatoria

  • Research article

Cographic and Global Cographic Domination Number of a Graph

S.B. Rao1, Aparna Lakshmanan S.2, A. Vijayakumar3
1Stat-Math Unit Indian Statistical Institute Kolkata-700 108 India
2Department of Mathematics Cochin University of Science and Technology Cochin-682 022 India
3Department of Mathematics Cochin University of Science and Technology Cochin-682 022 India.
  • Published: 30/04/2010

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.

Citation
S.B. Rao, Aparna Lakshmanan S., A. Vijayakumar. Cographic and Global Cographic Domination Number of a Graph[J], Ars Combinatoria, Volume 095. 473-486. .