Firman Firman
Universitas Jember

Published : 1 Documents Claim Missing Document
Claim Missing Document
Check
Articles

Found 1 Documents
Search

Rainbow Vertex Connection Number pada Keluarga Graf Roda Firman Firman; Dafik Dafik; Ermita Rizki Albirri
CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS Vol 3, No 1 (2022): CGANT JOURNAL OF MATHEMATICS AND APPLICATIONS
Publisher : jcgant

Show Abstract | Download Original | Original Source | Check in Google Scholar | Full PDF (498.996 KB) | DOI: 10.25037/cgantjma.v3i1.71

Abstract

The rainbow vertex connection was first introduced by krivelevich and yuster in 2009 which is an extension of the rainbow connection. Let graph $G =(V,E)$ is a connected graph. Rainbow vertex-connection is the assignment of color to the vertices of a graph $G$, if every vertex on graph $G$ is connected by a path that has interior vertices with different colors. The minimum number of colors from the rainbow vertex coloring in graph $G$ is called rainbow vertex connection number which is denoted $rvc(G)$. The result of the research are the rainbow vertex connection number of family wheel graphs.