A solution to a conjecture on the rainbow connection number

Details A solution to a conjecture on the rainbow connection number A solution to a conjecture on the rainbow connection number

2010-12-13

arxiv.org/abs/1012.2693v2

Mathematics

Combinatorics

4 pages

Scientific paper

For a graph $G$, Chartrand et al. defined the rainbow connection number $rc(G)$ and the strong rainbow connection number $src(G)$ in "G. Charand, G.L. John, K.A. Mckeon, P. Zhang, Rainbow connection in graphs, Mathematica Bohemica, 133(1)(2008) 85-98". They raised the following conjecture: for two given positive $a$ and $b$, there exists a connected graph $G$ such that $rc(G)=a$ and $src(G)=b$ if and only if $a=b\in\{1,2\}$ or $ 3\leq a\leq b$". In this short note, we will show that the conjecture is true.

Affiliated with

Also associated with

No associations

Rating

A solution to a conjecture on the rainbow connection number 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 A solution to a conjecture on the rainbow connection number, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A solution to a conjecture on the rainbow connection number will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-26981