Abstract
Dense, symmetric graphs are good candidates for effective interconnection networks. Cayley graphs, formed by Borel subgroups, are the densest, symmetric graphs known for a range of diameters [1]. Every Cayley graph can be represented with integer node labels by transforming into another existing topology, Generalized Chordal Ring (GCR) [2]. However, generally speaking, GCR graphs are not fully symmetric. In this paper, we provide a framework for the formulation of the complete symmetry (or vertex-transitivity) of Cayley graphs in the integer domain of GCR representations. Successful realization of such formulation offers a simple, iterative routing algorithm that is capable of determining multiple, shortest paths between any source and destination pairs. An example from a Borel Cayley graph is used to illustrate this concept.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
