Domination number of cubic graphs with large girth
Daniel Král͏̌, Petr Škoda, Jan Volec · Journal of Graph Theory · 2011
Abstract We show that every n‐vertex cubic graph with girth at least g have domination number at most 0.299871n+ O(n/g)<3n/10 + O(n/g) which improves a previous bound of 0.321216n+ O(n/g) by Rautenbach and Reed. © 2011 Wiley Periodicals, Inc. J Graph Theory 69:131‐142, 2012