Networks of evolutionary processors: wheel graph simulation

We propose a simulation of an arbitrary network of evolutionary processors by a network having a special underlying graph, namely a wheel (ring-star) graph. This work continues a series of papers devoted to simulations between networks of evolutionary processors with various topologies. Somehow unexpected, the simulation is time complexity preserving at the price of a much larger network.