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 |
| Summary: | 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;] is said set of internally disjoint S-tree. Define an edge t-coloring c : E(G) ! f1; 2; :::; tg, t 2 N on G with adjency edges can be colored the same. T is said to be a rainbow tree if every edges on T has different color. A t-coloring that every k-subset has ` internally disjoint rainbow S-tree is called (k;)-rainbow t-coloring. The (k;)-rainbow index of G, denoted by rxk;`(G), is a minimum t such that G has a (k; )-rainbow t-coloring. |
|---|