Abstract
The rainbow connection number of G, denoted by rc(G), is the smallest number of colors needed to color its edges, so that every pair of its vertices is connected by at least one path in which no two edges are colored the same. A rainbow u v geodesic in G is a rainbow 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 u v geodesic for any two vertices u and v in G. The strong rainbow connection number src(G) of G is the minimum number of colors needed to make G strongly rainbow connected. In this paper we determine the exact values of the windmill graph K (n) m . Moreover, we compute the rc(G H) where G or H is complete graph Km or path P2 with m is an integer. These graphs we studied have progressive connection on structure. Mathematics Subject Classication: 05C15, 05C40
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
