Domination number of cubic graphs with l
✍
Daniel Král'; Petr Škoda; Jan Volec
📂
Article
📅
2011
🏛
John Wiley and Sons
🌐
English
⚖ 219 KB
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) This research was done when the Petr Škoda was a student of