Abstract
Abstract
A u − ν rainbow path is a path that connects two vertices u and ν in a graph G and every edge in that path has a different color. A connected graph G is called a rainbow graph if there is a rainbow path for every pair of vertices in G. For any two vertices u and ν in G, a rainbow u − ν geodesic in G is the shortest rainbow u − ν path. The d-local strong rainbow number (lsrc
d
) is the smallest number of colors needed to color the edges of G such that any two vertices with distance at most d can be connected by a rainbow geodesic. Thus, the value of d is in the interval 1 < d < diam(G). In this paper, we show the lsrc
d
of prism graphs with d = 2 and d = 3, and the generalized formula of lsrc
d
for any value of d.
Subject
General Physics and Astronomy
Reference10 articles.
1. Rainbow connection number of graphs;Chartrand;Math. Bohem.,2008
2. Rainbow connection and strong rainbow connection of the crystal graph and neurons graph;Lubis;AIP Conference Proceeding,2019
3. Equitable coloring of prism graph and it’s central, middle, total and line graph;Praveena;International Journal of Scientific & Technology Research,2019