A mathematical model for finding the rainbow connection number
Bildiriler > Tam Metin Bildiri
Yazarlar: Fidan Nuriyeva, Onur Ugurlu, Hakan Kutucu
2013 7th International Conference on Application of Information and Communication Technologies, , , Uluslararası, Tam Metin Bildiri, ss 1-3
DOI: 10.1109/icaict.2013.6722630
Özet
The rainbow connection problem belongs to the class of NP-Hard graph theoretical problems. The rainbow connection of a connected graph G, denoted by rc(G), is the smallest number of colors that are needed in order to make G rainbow edge-connected. In this study, we present a new mathematical model for the rainbow connection problem.