Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six
M. Olsen (),
D. González-Moreno (),
J. Cervantes-Ojeda () and
M. Gómez-Fuentes ()
Journal of Applied Mathematics, 2019, vol. 2019, 1-7
A rainbow -coloring of a - connected graph is an edge coloring such that for any two distinct vertices and of there are at least internally vertex-disjoint rainbow - paths. In this work, we apply a Rank Genetic Algorithm to search for rainbow - colorings of the family of Moore cages with girth six - cages. We found that an upper bound in the number of colors needed to produce a rainbow 4-coloring of a - cage is 7, improving the one currently known, which is 13. The computation of the minimum number of colors of a rainbow coloring is known to be NP-Hard and the Rank Genetic Algorithm showed good behavior finding rainbow - colorings with a small number of colors.
References: Add references at CitEc
Citations: Track citations by RSS feed
Downloads: (external link)
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
Persistent link: https://EconPapers.repec.org/RePEc:hin:jnljam:4073905
Access Statistics for this article
More articles in Journal of Applied Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().