Rainbow Connectivity Using a Rank Genetic Algorithm: Moore Cages with Girth Six
A rainbow t-coloring of a t-connected graph G is an edge coloring such that for any two distinct vertices u and v of G there are at least t internally vertex-disjoint rainbow (u,v)-paths. In this work, we apply a Rank Genetic Algorithm to search for rainbow t-colorings of the family of Moore cages w...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi Limited
2019-01-01
|
| Series: | Journal of Applied Mathematics |
| Online Access: | http://dx.doi.org/10.1155/2019/4073905 |