Académique Documents
Professionnel Documents
Culture Documents
Connection Number of
Star Wheel Graphs
ARIESTHA WIDYASTUTY BUSTAN
M SALMAN A.N
INTRODUCTION
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.
So we conclude that
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,1 ≤𝑚+1 (4)
Let 𝑚 and 𝑛 be two integers at least 3 and 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 be a star wheel graph, then
𝑟𝑣𝑐 𝑆 𝑚, 𝑊𝑛 , 𝑣𝑖,𝑚+1 =𝑚 + 1
REFERENCES
Diestel, R. (2010), Graph Theory, 4th edition, springer.
Krivelevich, M and Yuster, R. (2009), The rainbow connecton of a graph is (at most) reciprocal to
its minimum degree three. J. Graph Theory, 63 (3), 185-191.
Li, X and Liu, S. (2011), Rainbow vertex-connection number of 2-connected graphs.
Arxiv:1110.5770v1[math.CO]2011.
Simamora, D.N.S and Salman, A.N.M. (2015), The rainbow (vertex) connection number of pencil
graphs, Procedia 74, 138-142.
Bustan, A. W., & Salman, A. N. M. (2018). The Rainbow Vertex-Connection Number of Star Fan
Graphs. CAUCHY, 5(3), 112-116.