THE LOCATING RAINBOW CONNECTION NUMBERS OF SOME GRAPH CLASSES
Let k be a positive integer and G = (V (G);E(G)) be a finite and connected graph. A rainbow vertex k-coloring of G is a function c : V (G) ????! f1; 2; :::; kg such that for every u and v in V (G) there exists a rainbow path connecting them. A path P of G whose all internal vertices have distinct...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/83917 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |