Abstract
We give a few examples of applications of techniques and results borrowed from error-correcting codes to problems in graphs and interconnection networks. The degree and diameter of Cayley graphs with vertex set ( Z 2Z ) r are investigated. The asymptotic case is dealt with in Section 2. The robustness, or fault tolerance, of the n-cube interconnection network is studied in Section 3.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.