Loading...
Please wait, while we are loading the content...
Similar Documents
Cayley Graphs and Interconnection Networks (1997)
| Content Provider | CiteSeerX |
|---|---|
| Author | Heydemann, Marie-Claude Ducourthial, Bertrand |
| Description | In this report, we will focus on routing problems including connectivity, diameter and loads of routings. We place the emphasis on load problems, since new classes of vertex-transitive graphs (see quasi-Cayley graphs in Section 5.3) or edge-transitive graphs (see regular orbital graphs in Section 5.6) were studied in order to enlarge the class of graphs behaving well for loads of routings. More precisely, after recalling some basic definitions and properties in Chapter 2, we survey particular classes of Cayley graphs which are often studied as models of interconnection networks. First, we study Cayley graphs generated by transpositions (Section 3.1) and those with a special automorphism which rotates the generators and is called a complete rotation (Section 3.2). In Section 3.3, we present hierarchical Cayley digraphs and results about fault tolerance. Finally, multistage Cayley digraphs and their quotients are studied in Section 3.4. |
| File Format | |
| Language | English |
| Publisher | Kluwer Academic Publishers |
| Publisher Date | 1997-01-01 |
| Access Restriction | Open |
| Subject Keyword | Complete Rotation Load Problem Special Automorphism Basic Definition Interconnection Network New Class Regular Orbital Graph Cayley Graph Survey Particular Class Vertex-transitive Graph Multistage Cayley Digraph Hierarchical Cayley Digraph Edge-transitive Graph Graph Behaving Quasi-cayley Graph Fault Tolerance |
| Content Type | Text |
| Resource Type | Article |
