Abstract

In a network of processors representing a massively parallel computer, the speed of communication is related to the diameter of the underlying graph. We investigate how the diameter of the hypercube Q n is affected by the removal of edges (presence of edge faults). In particular, we calculate the least number of edges whose removal increases the diameter and we show that asymptotically most of the edges of Q n may be removed without changing the diameter. For this purpose, a new family of spanning subgraphs of Q n of minimum diameter are constructed from pairs of broadcast trees. The corresponding invariants for edge addition to hypercubes are also determined.

Full Text
Paper version not known

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.