By Topic

Analysis of interconnection networks based on simple Cayley coset graphs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Jen-peng Huang ; Parallel Processing Inst., Oklahoma Univ., Norman, OK, USA ; Lakshmivarahan, S. ; Dhall, S.K.

While the concept of Cayley coset graphs has been around for a long time, it is only recently the present authors derived conditions for a Cayley coset graph to be simple - not containing self loops and multiple edges. Building on this result a whole host of Cayley coset graphs - coset star graph, coset bubblesort graph, coset modified bubblesort graph, coset complete transposition graph to mention a few, have been identified. This paper represents the first attempt to evaluate the use of Cayley coset graphs in the design of interconnection networks for parallel computers. We first derive conditions for a simple Cayley coset graph to be vertex transitive. We then present a family of Cayley coset star graphs and analyze a number of its properties. It is shown that this family is recursively scalable, contains star graphs as a subgraph, and is Hamiltonian. We derive conditions for this family to bipartite and edge transitive. Finally, a shortest path algorithm and an enumeration of node disjoint paths are given. A number of open questions are listed in the conclusion

Published in:

Parallel and Distributed Processing, 1993. Proceedings of the Fifth IEEE Symposium on

Date of Conference:

1-4 Dec 1993