THE (STRONG) 3-RAINBOWINDEX OF AMALGAMATION OF SOME GRAPHS
Let G be a nontrivial and connected graph with n vertices, and let k be an integer with 2 k n. Let h 2 N, define an edge h-coloring c : E(G) ! f1; 2; :::; hg where adjacent edges may be colored the same. A tree T in G is a rainbow tree if no two edges of T receive the same color. A k-rainbow h-...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Subjects: | |
| Online Access: | https://digilib.itb.ac.id/gdl/view/32166 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |