THE STRONG 3-RAINBOW INDEX OF SOME GRAPHS AND CERTAIN GRAPHS FORMED BY GRAPH OPERATIONS
Let G be a simple connected graph of order n with an h-edge coloring c : E(G) ! f1; 2; : : : ; hg, h 2 N, where adjacent edges may be colored the same. Let k be an integer with k 2 f2; 3; : : : ; ng. A tree T in G is a rainbow tree if no two edges of T have the same color. Let S V (G) with jSj =...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/51964 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |