Routing in Recursive Circulant Graphs: Edge Forwarding Index and Hamiltonian Decomposition

The recursive circulant graphs G(2 m ,4) were described in [13] as a concurrent to the hypercube considered as topology for multicomputer networks. In this paper we give the exact value of the edge forwarding index and bisection width of the generalize recursive circulant graphs G(cd m ,d) with d > c > 0. Moreover we prove that they admit a Hamiltonian decomposition.