THE RAINBOW CONNECTION NUMBER AND THE RAINBOW VERTEX CONNECTION NUMBER OF SPLITTING GRAPH OF SOME CLASSES OF GRAPH
if every two vertices in G are connected by a path whose edges have distinct colors. Such a path is called rainbow path. We denote rc(G), the rainbow connection number of G, as the smallest number of colors needed in order to make G rainbow connected. The vertex-colored graph G is said rainbow v...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/54951 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |