• RAINBOW CONNECTION NUMBER OF HELM GRAPH
Abstract
A path between two vertices is a rainbow path if no two edges in this path have the same color. If there is rainbow path between every pair of vertices then the coloring is rainbow coloring. Minimum number of colors required to achieve rainbow connection number. It is denoted by rc (G) where G is a graph. In this paper we found the rainbow connection number for Helm graph.
Keywords
Rainbow coloring, Rainbow path, Rainbow connection number, Helm graph.
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 |