Ariestha Widyastuty BustanA.N.M. Salman
A vertex-colored graph is said to be rainbow vertex-connected, if for every two vertices and in , there exists a path with all internal vertices have distinct colors. The rainbow vertex connection number of , denoted by is the smallest number of colors needed to make rainbow vertex connected. In this paper, we determine the rainbow vertex connection number of star fan graphs.
Ariestha Widyastuty BustanA.N.M. Salman
Dian N.S. SimamoraA.N.M. Salman
W. D. D. P. DewanandaK. K. K. R. Perera