Rainbow Vertex Connection Number of Broom Graph, Triangular Book Graph and Triangular Book with Bookmark
V. Jothika, P. Mythili · International Journal of Research and Innovation in Applied Science · 2025
The Rainbow Vertex Connection Number of a graph is the minimum number of colors required to make a graph rainbow vertex connected. A graph is said to be a rainbow vertex connected if there exists a rainbow vertex path between every pair of distinct vertices. In this paper the rvc(G) of broom graph, triangular book graph and triangular book with bookmark is found.