TITLE: Hypercycles inter-connection networks with simple routing strategies AUTHORS: Dimopoulos, N.J., R.D. Rasmussen, G.S. Bolotin, B.F. Lewis and R.M. Manning IN: Proceedings of 1988 Can. Conf. on Electrical and Computer Engineering, Vancouver, BC, pp. 577-580, Nov. 1988. ABSTRACT In this work, we present the Hypercycles, a class of multidimensional graphs, which are generalizations of the n-cube. These graphs are obtained by allowing each dimension to incorporate more than two elements and a cyclic interconnection strategy. Hypercycles, offer simple routing, and the ability, given a rixed degree, to chose among a number of alternative size graphs. These graphs can be used in the design of interconnection networks for distributed systems tailored specifically to the topology of a particular application.