Abstract
Distributed computer systems can be modeled using graph theory to evaluate potential network topologies. A good network from a communication standpoint should have a small diameter because this allows all pairs of processors to communicate quickly. This paper presents a new construction method for interconnection networks, which is a generalization of the chordal ring networks of Arden and Lee. The graphs produced by this method are the largest known for many degrees and diameters.
Sign-in/Register to access full text options 
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.
