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:

Rautenbach, Dieter / Reed, Bruce: Domination in cubic graphs of large girth. 2007.

Access Statistic

Total:
Downloads:
Abtractviews:
Last 12 Month:
Downloads:
Abtractviews:

open graphic

Rights

Use and reproduction:
All rights reserved

Export