Abstract
A path in an edge-colored graph , 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 of is the minimum integer for which there exists an -edge-coloring of such that every two distinct vertices of are connected by a rainbow path. The strong rainbow connection number of is the minimum integer for which there exists an -edge-coloring of such that every two distinct vertices and of are connected by a rainbow path of length . 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.
Connections
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 review
No reviews yet.
Discussion 0
Add a comment
No comments yet.