Open AccessRAINBOW CONNECTION PADA GRAF k -CONNECTED UNTUK k = 1 ATAU 2
Author(s) -
Sally Marhelina
Publication year - 2013
Publication title -
jurnal matematika unand/jurnal matematika unand
Language(s) - English
Resource type - Journals
eISSN - 2721-9410
pISSN - 2303-291X
DOI - 10.25077/jmu.2.1.78-84.2013
Subject(s) - rainbow , combinatorics , connectivity , mathematics , graph , connection (principal bundle) , discrete mathematics , physics , geometry , optics
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 aconnected graph G, denoted by rc(G) is the smallest number of colors needed such thatG is rainbow connected. In this paper, we will proved again that rc(G) ≤ 3(n + 1)/5 forall 3-connected graphs, and rc(G) ≤ 2n/3 for all 2-connected graphs.