The Layered Cross Product (LCP) is defined. It is shown
that certain interconnection networks, such as the Butterfly, the
Mesh of Trees and two types of Fat-Trees are easily defined as the
products of very simple multiplicands.
A methodology to create grid layouts of layered graphs is
introduced. It uses the LCP and Descriptive Geometry. The technique
is demonstrated for the Butterfly and for 2 and 3 dimensional grid
layouts of the complete binary tree.