Broadcasting on incomplete hypercubes

Incomplete hypercubes make the hypercubes more flexible on task allocation in large cubes, cost of manufacturing hardware, and hypercubes with faulty nodes. The authors devise and analyze broadcasting algorithms based on the hierarchical binomial spanning trees, hierarchical edge-disjoint spanning trees and edge-disjoint spanning trees in an incomplete hypercube of 2/sup n/+2/sup k/ nodes, where 0>