Publication details
Domination number of cubic graphs with large girth
| Authors | |
|---|---|
| Year of publication | 2012 |
| Type | Article in Periodical |
| Magazine / Source | Journal of Graph Theory |
| Citation | |
| Doi | http://dx.doi.org/10.1002/jgt.20568 |
| Keywords | domination; dominating number; cubic graphs; probabilistic method |
| Description | 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. (C) 2011 Wiley Periodicals, Inc. J Graph Theory 69:131-142, 2012 |