Nordhaus-Gaddum-type theorem for rainbow connection number of graphs

Details Nordhaus-Gaddum-type theorem for rainbow connection number of graphs Nordhaus-Gaddum-type theorem for rainbow connection number of graphs

2010-12-13

arxiv.org/abs/1012.2641v2

Mathematics

Combinatorics

13 pages

Scientific paper

An edge-colored graph $G$ is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of $G$, denoted $rc(G)$, is the minimum number of colors that are used to make $G$ rainbow connected. In this paper we give a Nordhaus-Gaddum-type result for the rainbow connection number. We prove that if $G$ and $\bar{G}$ are both connected, then $4\leq rc(G)+rc(\bar{G})\leq n+2$. Examples are given to show that the upper bound is sharp for all $n\geq 4$, and the lower bound is sharp for all $n\geq 8$. For the rest small $n=4,5,6,7,$ we also give the sharp bounds.

Affiliated with

Also associated with

No associations

Rating

Nordhaus-Gaddum-type theorem for rainbow connection number of graphs 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 Nordhaus-Gaddum-type theorem for rainbow connection number of graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nordhaus-Gaddum-type theorem for rainbow connection number of graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26647