• RAINBOW CONNECTION NUMBER OF FLOWER GRAPH
Abstract
A path P in graph G is rainbow path if no two edges of P are colored the same. The graph G is rainbow connected if G contains a rainbow u-v path for every two vertices u and v of G. In this case the coloring C is called a rainbow coloring of G. If n colors are used then C is rainbow n - coloring. The minimum n for which there exists a rainbow n- coloring of the edges of G is called rainbow connection number. It is denoted by rc (G) where G is a graph. In this paper we found the rainbow connection number for Flower graph.
Keywords
Rainbow coloring, Rainbow path, Rainbow connection number, Wheel graph, Helm graph, Flower graph.
Full Text:
pdfThis 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 |