Domination in cubic graphs of large girth
We prove that connected cubic graphs of order n and girth g have domination number at most 0.32127n + O(n/g)
, Dieter / Reed , Bruce: Domination in cubic graphs of large girth. 2007.
Total:Last 12 Month:
Use and reproduction:
All rights reserved