BILANGAN TERHUBUNG TITIK PELANGI PADA AMALGAMASI GRAF BERLIAN

Abstract

Suppose there is a simple, and finite graph G = (V, E). The coloring of vertices c is denoted by c: E(G) → {1,2, ..., k} with k is the number of rainbow colors on graph G. A graph is said to be rainbow connected if every pair of points x and y has a rainbow path. A path is said to be a rainbow if there are not two edges that have the same color in one path. The rainbow connected number of graph G denoted by rc(G) is the smallest positive integer-k which makes graph G has rainbow coloring. Furthermore, a graph is said to be connected to rainbow vertex if at each pair of vertices x and y there are not two vertices that have the same color in one path. The rainbow vertex connected to the number of graph G is denoted by rvc(G) is the smallest positive integer-k which makes graph G has rainbow coloring. This paper discusses rainbow vertex-connected numbers in the amalgamation of a diamond graph. A diamond graph with 2n points is denoted by an amalgamation of a diamond graph by adding the multiplication of the graph t at point v is denoted by Amal (Brn,v,t).