Rainbow Connection Number Of Graph Power And Graph Products
The minimum number of colors required to color the edges of a graph so that any two distinct vertices are connected by at least one path in which no two edges are colored the same is called its rainbow connection number. This graph parameter was introduced by Chartrand et al. in 2008. The problem ha...
| Main Author: | |
|---|---|
| Other Authors: | |
| Language: | en_US |
| Published: |
2014
|
| Subjects: | |
| Online Access: | http://etd.iisc.ernet.in/handle/2005/2383 http://etd.ncsi.iisc.ernet.in/abstracts/3066/G25301-Abs.pdf |