OPTIMAL LAYOUT OF TRIVALENT CAYLEY INTERCONNECTION NETWORKS

In this paper we deal with the layout of Trivalent Cayley Interconnection Networks. Namely, we prove that a lower bound on their layout area is Ω(2^n-1× 2^n-1) and we exhibit some methods to lay these networks out in O(2^n-1× 2^n-1).

We piont out that these layout methods work for other networks decomposable into equal length cycles connected by following fixed rules.