• ON RAINBOW CONNECTIONS OF SOME CLASSES OF GRAPHS
Abstract
The rainbow connection number, rc(G), of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one path in which no two edges are colored the same. And the strong rainbow connection number, src(G) of a connected graph G is the minimum number of colors needed to color its edges, so that every pair of vertices is connected by at least one geodesic in which no two edges are colored the same.
Keywords
rainbow coloring, strong rainbow coloring, rainbow connection number, strong rainbow connection number, sun graph, barbell graph, lollipop graph, tadpole graph, power graph of a path.
Full Text:
pdf
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
| © 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |