“…As illustrations of recently proposed interconnection networks, we point to the recursive cubes of rings (see [10], building on [13]) and the variational networks of cube-connected cycles [17]. The purpose of this short note is to point out that the variational networks of cube-connected cycles are, in fact, isomorphic to particular recursive cubes of rings; consequently, the algorithm to find a shortest path joining any two nodes of a variational network of cube-connected cycles and the derivation of the diameter of the network in [17] are actually subsumed by the optimal routing algorithm and derivations in [10].…”