Author:
Bustan Ariestha Widyastuty,Salman A.N.M.
Abstract
<p>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.</p>
Publisher
Maulana Malik Ibrahim State Islamic University
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Rainbow vertex-connection number on a small-world Farey graph;AKCE International Journal of Graphs and Combinatorics;2022-01-02
2. The rainbow vertex connection number of star wheel graphs;INTERNATIONAL CONFERENCE ON SCIENCE AND APPLIED SCIENCE (ICSAS) 2019;2019