Abstract

A parallel and distributed system is usually represented by a graph. The maximum communication delay between any pair of processors in a parallel and distributed system can be determined by the diameter of its underlying graph. The diameter of a graph can be affected by the addition or deletion of edges. In this paper, we show that the diameter of an n-dimensional hypercube can be decreased by k with the addition of 22k−1 edges for 1≤k≤⌊n/2⌋.

Full Text

Published Version

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 call

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.