RAINBOW 2-CONNECTION NUMBER OF SOME GRAPH CLASSES
The concept of rainbow connection number was introduced by Chartrand et al. which was then generalized by the concept of rainbow k-connectivity of a finite and ?-connected graph. The rainbow k-connection number of a graph G, denoted by rck(G), is defined as the minimum integer j for which there exis...
Saved in:
| Main Author: | |
|---|---|
| Format: | Dissertations |
| Language: | Indonesia |
| Online Access: | https://digilib.itb.ac.id/gdl/view/45890 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Institut Teknologi Bandung |
| Language: | Indonesia |