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. >
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.
