Title :
Representations and routing for Cayley graphs [computer networks]
Author :
Arden, Bruce W. ; Tang, K. Wendy
Author_Institution :
Dept. of Electr. Eng., Rochester Univ., NY, USA
fDate :
11/1/1991 12:00:00 AM
Abstract :
It is shown that all finite Cayley graphs can be represented by generalized chordal rings (GCR). An example Borel Cayley graph is used to illustrate the generation of GCR representations. A sufficient condition is given for the representation of a Cayley graph as a chordal ring (CR). With the integer labeling of GCR representations, a straightforward, progressive routing algorithm based on table look-up is summarized
Keywords :
graph theory; multiprocessor interconnection networks; Borel Cayley graph; finite Cayley graphs; generalized chordal rings; integer labeling; multiprocessor interconnection networks; progressive routing algorithm; table look-up; Chromium; Computer network management; Computer networks; Computer science; Multiprocessor interconnection networks; Routing; Societies; Sufficient conditions; Symmetric matrices;
Journal_Title :
Communications, IEEE Transactions on
