BROADCASTING ON INCOMPLETE HYPERCUBES

Abstract

Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. In this correspondence, we devise and analyze a broadcasting algorithm based on edge-disjoint spanning trees in an incomplete hypercube of 2n + 2k nodes, where 0 less-than-or-equal-to k less-than-or-equal-to n. The broadcasting algorithm is strictly optimal.