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

preprint2010arXivOpen access

Abstract

A path in an edge-colored graph GG, 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)rc(G) of GG is the minimum integer ii for which there exists an ii-edge-coloring of GG such that every two distinct vertices of GG are connected by a rainbow path. The strong rainbow connection number src(G)src(G) of GG is the minimum integer ii for which there exists an ii-edge-coloring of GG such that every two distinct vertices uu and vv of GG are connected by a rainbow path of length d(u,v)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.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.