The (strong) rainbow connection numbers of Cayley graphs of Abelian groups

Details The (strong) rainbow connection numbers of Cayley graphs of Abelian groups The (strong) rainbow connection numbers of Cayley graphs of Abelian groups

2010-11-03

arxiv.org/abs/1011.0827v3

Mathematics

Combinatorics

12 pages

Scientific paper

A path in an edge-colored graph $G$, where adjacent edges may have the same color, is called a rainbow path if no two edges of the path are colored the same. The rainbow connection number $rc(G)$ of $G$ is the minimum integer $i$ for which there exists an $i$-edge-coloring of $G$ such that every two distinct vertices of $G$ are connected by a rainbow path. The strong rainbow connection number $src(G)$ of $G$ is the minimum integer $i$ for which there exists an $i$-edge-coloring of $G$ such that every two distinct vertices $u$ and $v$ of $G$ are connected by a rainbow path of length $d(u,v)$. In this paper, we give upper and lower bounds of the (strong) rainbow connection Cayley graphs of Abelian groups. Moreover, we determine the (strong) rainbow connection numbers of some special cases.

Affiliated with

Also associated with

No associations

Rating

The (strong) rainbow connection numbers of Cayley graphs of Abelian groups 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 The (strong) rainbow connection numbers of Cayley graphs of Abelian groups, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The (strong) rainbow connection numbers of Cayley graphs of Abelian groups will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-602725