ON THE LOCATING RAINBOW CONNECTION NUMBER FOR CORONA PRODUCT OF GRAPHS

• Main Author: Dharia M Taihuttu, Pranaya
• Format: Theses
• Language: Indonesia
• Online Access: https://digilib.itb.ac.id/gdl/view/53761
• Institution: Institut Teknologi Bandung

Let k be a positive integer and G = (V;E) be a finite and connected graph. A path P of G whose all internal vertices have distinct colors is called a rainbow vertex path. A vertex k-coloring of G is function c : V (G) ! f1; 2; ; kg such that for every u and v in V (G) there exists a rainbow ve...