THE LOCATING RAINBOW EDGE 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-edge-k-coloring of G is a function c : E(G) ? {1, 2, ..., k} such that for every u and v in V (G) there exists a rainbow edge path that connects them. Let e = uv and f = xy are element of edges in G, denot...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/87978 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |