A path in an edge-colored graph, where adjacent edges may be colored the same, is a rainbow path if no two edges of it are colored the same. For any two vertices u and v of G, a rainbow ui v geodesic in G is a rainbow ui v path of length d(u; v), where d(u; v) is the distance between u and v. The graph G is strongly rainbow connected if there exists a rainbow ui v geodesic for any two vertices u and v in G. The strong rainbow connection number of G, denoted by src(G), is the minimum number of colors that are needed in order to make G strongly rainbow connected. In this paper, we first give a sharp upper bound for src(G) in terms of the number of edge-disjoint triangles in a graph G, and give a necessary and sufficient condition for the equality. We next investigate the graphs with large strong rainbow connection numbers. Chartrand et al. obtained that src(G) = m if and only if G is a tree, we will show that src(G) 6 mi 1, and characterize the graphs G with src(G) = mi 2 where m is the number of edges of G.
[1]
Xueliang Li,et al.
Rainbow connection numbers of line graphs
,
2011,
Ars Comb..
[2]
Xueliang Li,et al.
Upper Bounds for the Rainbow Connection Numbers of Line Graphs
,
2012,
Graphs Comb..
[3]
Garry L. Johns,et al.
Rainbow connection in graphs
,
2008
.
[4]
Raphael Yuster,et al.
On Rainbow Connection
,
2008,
Electron. J. Comb..
[5]
Meghana Nasre,et al.
New Hardness Results in Rainbow Connectivity
,
2011,
ArXiv.
[6]
Xueliang Li,et al.
Rainbow Connections of Graphs: A Survey
,
2011,
Graphs Comb..
[7]
J. A. Bondy,et al.
Graph Theory
,
2008,
Graduate Texts in Mathematics.
[8]
Xueliang Li,et al.
Rainbow Connections of Graphs
,
2012
.