Domination number of cubic graphs with large girth

Details Domination number of cubic graphs with large girth Domination number of cubic graphs with large girth

2009-07-07

arxiv.org/abs/0907.1166v1

Mathematics

Combinatorics

Scientific paper

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).

Affiliated with

Also associated with

No associations

Rating

Domination number of cubic graphs with large girth does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Domination number of cubic graphs with large girth, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Domination number of cubic graphs with large girth will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-355535