Nuriyeva, F.Ugurlu, O.Kutucu, H.2024-09-292024-09-292013978-146736420-1https://doi.org/10.1109/ICAICT.2013.6722630https://hdl.handle.net/20.500.14619/9416Azercell Telecom; MIKRO Bilgi; State Oil Company of Azerbaijan Republic (SOCAR); Turkish Cooperation and Coordination Agency (TIKA); TUSIAB7th International Conference on Application of Information and Communication Technologies, AICT 2013 -- 23 October 2013 through 25 October 2013 -- Baku -- 102729The 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. © 2013 IEEE.eninfo:eu-repo/semantics/closedAccessmathematical modellingoptimizationRainbow connectionConference Object10.1109/ICAICT.2013.67226302-s2.0-84894136347N/A