Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Total Domination in Claw-Free Cubic Graphs

E. J. Cockayne1, O. Favaront2, C. M. Mynhardt3
1Department of Mathematics, University of Victoria, P. O. Box 3045, Victoria, BC, CANADA V8W 3P4;
2LRI, Bat. 490, Université Paris-Sud, 91405 Orsay Cedex, FRANCE;
3Department of Mathematics, University of South Africa, P. O. Box 392, Unisa, 0003 SOUTH AFRICA;
  • Published: 30/11/2002

Abstract

We prove that the total domination number of an \(n\)-vertex claw-free cubic graph is at most \({n}/{2}\).

Information
Guidelines
CP Initiatives
Follow CP
Facebook X-twitter Linkedin

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

Citation
E. J. Cockayne, O. Favaront, C. M. Mynhardt. Total Domination in Claw-Free Cubic Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 043. 219-225. DOI: .