THE MINIMAL SIZE OF RAINBOW 3-CONNECTED GRAPH

• Main Author: SHULHANY (NIM: 20114053), AHMAD
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/20860
• Institution: Institut Teknologi Bandung

All graph considered in this thesis are simple,unite, undirected, and nontrivial.Let r 2 N, n 2 N, and G = (V (G);E(G)) be a r-connected on n vertices. Function c : E(G) ! [1; k] is said a rainbow k-edge coloring on G, if any two vertices u and v there exists a u v path with all edges have different colors. The u v path like that is said a rainbow path. Let l 2 N with l r, c is said l-rainbow k-coloring, if any two distinct vertices u and v in G, there are l internally disjoint uv rainbow paths. A graph G which has been colored by l-rainbow k-coloring is called rainbow l-connected. The rainbow l-connection number, denoted by rcl(G), is the smallest number of colors needed to make G rainbow l-connected.