ComputingComputer ScienceMathematicsAlgorithmsCombinatoricsTopologyGeometric GraphsGraph AlgorithmsGraph TheoryNetwork DiameterRoutingRouting AlgorithmsBroadcastingGraph Embedding In Hypercube NetworksHypercube Network BroadcastingHypercube Network DiameterHypercube Network RoutingHypercube TopologyRouting In Hypercube Networks
Abstract Following the recursive definition of the hypercube Q n , we define the augmented cube AQ n . After showing that its graph is vertex‐symmetric, (2 n − 1)‐regular, and (2 n − 1)‐connected and that it has diameter ⌈ n /2⌉, we describe optimal routing and broadcasting procedures. The augmented cube possesses several embeddable properties that the hypercube and its variations do not possess. © 2002 Wiley Periodicals, Inc.
19
Topological properties of hypercubes
Yousef Saad, Martin H. Schultz · IEEE Transactions on Computers · 1988 · 1.4K citations
A survey of wormhole routing techniques in direct networks
Lionel M. Ni, Philip K. McKinley · Computer · 1993 · 1.4K citations
A variation on the hypercube with lower diameter
Kemal Efe · IEEE Transactions on Computers · 1991 · 306 citations
Paul Cull, Shawn M. Larson · IEEE Transactions on Computers · 1995 · 262 citations