Cartesian Product of Cayley Graphs
XU Ke-li · 2001
Cayley graphs, which represent a category of symmetric and regular graphs derivable from finite groups, have been shown to be very suitable to serve as interconnection network topologies. As an operation of graphs, the Cartesian product is an important method in constructing larger networks from some small and specified ones. In this paper, it is shown that the Cartesian product of Cayley graphs is still a Cayley graph. In illustration of this result, circulants, hypercubes, generalized hypercubes, toroidal meshes, cube-connected cycles and so on, are all Cayley graphs.