Sciweavers

GC
2008
Springer
14 years 2 months ago
Domination in Graphs of Minimum Degree at least Two and Large Girth
We prove that for graphs of order n, minimum degree 2 and girth g 5 the domination number satisfies 1 3 + 2 3g n. As a corollary this implies that for cubic graphs of order n ...
Christian Löwenstein, Dieter Rautenbach