Contents

Ars Combinatoria

  • Research article

The Forcing Domination Numbers of Some Graphs

Abdollah Khodkar1, S.M. Sheikholeslami2
1DEPARTMENT OF MATHEMATICS UNIVERSITY OF WEST GEORGIA CARROLLTON, GA 30118
2DEPARTMENT OF MATHEMATICS AZARBAIJAN UNIVERSITY OF TARBIAT MOALLEM TABRIZ, IRAN
  • Published: 31/01/2007

Abstract

In this paper, the forcing domination numbers of the graphs \(P_n \times P_3\) and \(C_n \times P_3\) are completely determined. This improves the previous results on the forcing domination numbers of \(P_n \times P_2\) and \(C_n \times P_2\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

1970-2025 CP (Manitoba, Canada) unless otherwise stated.

Citation
Abdollah Khodkar, S.M. Sheikholeslami. The Forcing Domination Numbers of Some Graphs[J], Ars Combinatoria, Volume 082. 365-379. .