DocumentCode
869661
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
Volume
39
Issue
11
fYear
1991
fDate
11/1/1991 12:00:00 AM
Firstpage
1533
Lastpage
1537
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;
fLanguage
English
Journal_Title
Communications, IEEE Transactions on
Publisher
ieee
ISSN
0090-6778
Type
jour
DOI
10.1109/26.111428
Filename
111428
Link To Document