Search
Close this search box.

Contents

Journal of Combinatorial Mathematics and Combinatorial Computing

  • Research article

Independence and Domination in \(3\)-Connected Cubic Graphs

EJ. Cockayne1, C.M. Mynhardt2
1Department of Mathematics University of Victoria Box 3045 Victoria, B.C, CANADA V8W 3P4
2Department of Mathematics University of South Africa Box 392 Pretoria 0001 SOUTH AFRICA
  • Published: 31/10/1991

Abstract

An infinite class of graphs is constructed to demonstrate that the difference between the independent domination number and the domination number of \(3\)-connected cubic graphs may be arbitrarily large.

Information
Guidelines
CP Initiatives
Follow CP
Facebook Twitter Linkedin
1970-2024 CP (Manitoba, Canada) unless otherwise stated.
Citation
EJ. Cockayne, C.M. Mynhardt. Independence and Domination in \(3\)-Connected Cubic Graphs[J], Journal of Combinatorial Mathematics and Combinatorial Computing, Volume 010. 173-182. DOI: .