GRAPHS WHOSE -RAINBOW INDEX IS k 1
Let G be a unite connected nontrivial graph and k 2 N. Let T be a tree on G and S V (G) is a k-subset. T is called S-tree if every members of S is on T. A group fT1 ; T2; Tlg of S-tree on G with V (Ti) V (Tj) = S for every pair <br /> <br /> <br /> i and j, with i and j in [1;...
Saved in:
| Main Author: | |
|---|---|
| Format: | Theses |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/23395 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |