
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.
rainbow vertex-connection number, QA1-939, graph, star fan graph, rainbow vertex-coloring, Mathematics, fan
rainbow vertex-connection number, QA1-939, graph, star fan graph, rainbow vertex-coloring, Mathematics, fan
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 3 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
