Analisis rainbow vertex connection pada beberapa graf khusus dan operasinya

Abstract

The vertex colored graph G is said rainbow vertex cennected, if for every two vertices are connected by a path whose internal vertices have distinct colors. The rainbow vertex connection number of G, denoted by rvc(G), is the smallest number of colors that are needed in order to make G rainbow vertex connected. On this research, will be raised the issue of how to produce graphs the results of some special graph and how to find the rainbow vertex connection. Operation that use cartesian product, crown product, and shackle. Theorem in this research rainbow vertex connection number in graph the results of operations Wd3,m □ Pn,,Wd3,m ⵙ Pn, and shack(Btm,v,n).