Domination in cubic graphs of large girth

Rautenbach, Dieter GND; Reed, Bruce

We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n + O(n/g)

Cite

Citation style:
Could not load citation form.

Rights

Use and reproduction:
All rights reserved

Export