On Rainbow Connection of Strongly Regular Graphs

Details On Rainbow Connection of Strongly Regular Graphs On Rainbow Connection of Strongly Regular Graphs

2010-01-19

arxiv.org/abs/1001.3413v3

Mathematics

Combinatorics

On Rainbow Connection of Strongly Regular Graphs

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 a connected graph $G$, denoted $rc(G)$, is the smallest number of colors that are needed in order to make $G$ rainbow connected. We prove if $G$ is a connected strongly $r$-regular graph and $r\geq 600$, then $rc(G)\leq3$. Specially, there is a constant $c$ such that $rc(G)\leq c$ for any connected strongly regular graph $G$.

Affiliated with

Also associated with

No associations

Rating

On Rainbow Connection of Strongly Regular 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 On Rainbow Connection of Strongly Regular Graphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On Rainbow Connection of Strongly Regular Graphs will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-127910