Rainbow Vertex Connection Number of Broom Graph, Triangular Book Graph and Triangular Book with Bookmark
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.
Authors
- V. Jothika
- P. Mythili
Publication Details
- Journal
- International Journal of Research and Innovation in Applied Science
- Published
- 2025-01-01
- DOI
- https://doi.org/10.51584/ijrias.2025.1005000106
- Primary Topic
- Graph Labeling and Dimension Problems
- Type
- article
- Field-Weighted Citation Impact
- 0.00