Sharp upper bound for the rainbow connection numbers of 2-connected graphs

Details Sharp upper bound for the rainbow connection numbers of 2-connected graphs Sharp upper bound for the rainbow connection numbers of 2-connected graphs

2011-05-21

arxiv.org/abs/1105.4210v2

Mathematics

Combinatorics

8 pages

Scientific paper

An edge-colored graph $G$, where adjacent edges may be colored the same, is rainbow connected if any two vertices of $G$ are connected by a path whose edges have distinct colors. The rainbow connection number $rc(G)$ of a connected graph $G$ is the smallest number of colors that are needed in order to make $G$ rainbow connected. In this paper, we give a sharp upper bound that $rc(G)\leq\lceil\frac{n}{2}\rceil$ for any 2-connected graph $G$ of order $n$, which improves the results of Caro et al. to best possible.

Affiliated with

Also associated with

No associations

Rating

Sharp upper bound for the rainbow connection numbers of 2-connected 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 Sharp upper bound for the rainbow connection numbers of 2-connected graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Sharp upper bound for the rainbow connection numbers of 2-connected graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-713176