Bilangan Terhubung Titik Pelangi pada Graf Hasil Operasi Korona Graf Prisma (P_(m,2)) dan Graf Lintasan (P_3)

Rainbow vertex-connection number is the minimum k-coloring on vertex graph G and denoted by rvc(G). Besides, rainbow-vertex connection can be applied to some special graphs, such as prism path graph. Graph operation a method used create new combining two graphs. Therefore, this research uses corona product form at resulting from of (Pm,2 P3) (P3 Pm,2). The results study obtain that theorem rainbow Pm,2) for 3 = m 7 are rvc (G) 2m 2.