Abstract
We propose a new family of directed interconnection network graphs for an arbitrary number of nodes. The proposed network graph is almost regular (the difference between the in-degrees and out degrees of nodes is 2, a constant independent of the size of the network), has a diameter sub logarithmic in the number of nodes, is optimally fault tolerant and can be defined for an arbitrary number of nodes.
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.
