RAINBOW CONNECTION PADA GRAF k -CONNECTED UNTUK k = 1 ATAU 2

Abstract

An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection number of a
connected graph G, denoted by rc(G) is the smallest number of colors needed such that
G is rainbow connected. In this paper, we will proved again that rc(G) ≤ 3(n + 1)/5 for
all 3-connected graphs, and rc(G) ≤ 2n/3 for all 2-connected graphs.