Domination in Cubic Graphs of Large Girth

  • Authors:

  • Dieter Rautenbach;Bruce Reed

  • Affiliations:

  • Institut für Mathematik, TU Ilmenau, Ilmenau, Germany D-98684;School of Computer Science, McGill University, Montreal, Canada and Projet Mascotte, I3S (CNRS/UNSA)-INRIA, Sophia Antipolis, France

  • Venue:
  • Computational Geometry and Graph Theory
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127$n+O\left(\frac{n}{g}\right)$.