Domination number of cubic graphs with large girth

arxiv: 0907.1166 · v1 · submitted 2009-07-07 · 🧮 math.CO

Daniel Kral , Petr Skoda , Jan Volec This is my paper

classification 🧮 math.CO

keywords cubicdominationgirthnumbereverygraphgraphslarge

0 comments

read the original abstract

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 paper has not been read by Pith yet.