BILANGAN KETERHUBUNGAN TITIK PELANGI BEBERAPA KELAS GRAF

Abstract

A graph G is called a rainbow vertex connected if every two vertices G are connected by a rainbow path, that is, a path whose all the internal vertices are of a different color. The rainbow vertex connection number of graph G denoted by rvc(G) is the minimum number of colors used to color all vertices by G such that the graph G is connected to rainbow vertex. The rainbow vertex connection number in a graph will not be less than the diameter of the graph minus one. The rainbow vertex connection number discussed in this article for various classes of graphs include complete graph K_n, complete bipartite graph K_m,n  , wheel graph W_n  , two-layer wheel graph W_n², complete multipartite graph _{Kn1,n2,...,nt}  , path P_n, comb graph GS_n, graph  , graph , graph , graph .

Keywords: graph, vertex coloring, rainbow vertex connection number.