RAINBOW CONNECTION NUMBERS OF SOME GRAPHS OF FINITE GROUPS
Consider a connected graph G with edge coloring, where adjacent edges may have the same color. A path in G is called a rainbow path if no two edges on the path share the same color. The rainbow connection number of G, denoted as rc(G), is the minimum number of colors required to color the edges o...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/84337 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |