Abstract
The binary hypercube Q n has a small diameter, but a relatively large number of links. Because of this, efforts have been made to determine the maximum number of links that can be deleted without increasing the diameter. However, the resulting networks are not vertex‐symmetric. We propose a family of vertex‐symmetric spanning subnetworks of Q n , whose diameter differs from that of Q n by only a small constant factor. When n=2k, the cube‐connected cycles network of dimension n is a vertex‐symmetric spanning subnetwork of Q n+lg n . By selectively adding hypercube links, we obtain a degree 6 vertex‐symmetric network with diameter 3n/2. We also introduce a vertex‐symmetric spanning subnetwork of Q n−1 with degree log2 n, diameter 3n/2−2, log2 n‐connectivity and maximal fault tolerance. This network hosts Q n−1 with dilation 2(log2 n)−1.
Similar content being viewed by others
References
S.B. Akers and B. Krishnamurthy, A group-theoretic model for symmetric interconnection networks, IEEE Transactions on Computers 38(4) (1989) 555–566.
A. Bouabdallah, C. Delorme and S. Djelloul, Edge deletion preserving the diameter of the hypercube, Discrete Applied Mathematics 63 (1995) 91–95.
H. Dweighter, American Mathematics Monthly 82 (1975) 1010.
P. Erdos, P. Hamburger, R. Pippert and W. Weakley, Hypercube subgraphs with minimal detours, Journal of Graph Theory 23 (1996) 119–128.
W.H. Gates and C.H. Papadimitriou, Bounds for sorting by prefix reversal, Discrete Mathematics 27 (1979) 47–57.
A. Gibbons, Algorithmic Graph Theory (Cambridge Univ. Press, Cambridge, UK, 1985).
C.D. Godsil, Connectivity of minimal Cayley graphs, Archiv der Mathematik 37 (1981) 473–476.
N. Graham and F. Harary, Changing and unchanging the diameter of a hypercube, Discrete Applied Mathematics 37/38 (1992) 265–274.
M. Heydari and I.H. Sudborough, On the diameter of the pancake network, Journal of Algorithms 25 (1997) 67–94.
M.-C. Heydemann, Cayley graphs and interconnection networks, in: Graph Symmetry, eds. G. Hahn and G. Sabidussi (Kluwer Academic Publishers, Amsterdam, 1997) pp. 167–224.
F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes (Morgan Kaufmann, San Mateo, CA, 1992).
W. Mader, Minimale n-fach kantenzusammenhängende Graphen, Mathematische Annalen 191 (1971) 21–28.
F.P. Preparata and J. Vuillemin, The cube connected cycles: A versatile network for parallel computation, Communications of the ACM 24(5) (1981) 300–309.
M.E. Watkins, Connectivity of transitive graphs, Journal of Combinatorial Theory 8 (1970) 23–29.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Bass, D.W., Sudborough, I.H. Removing edges from hypercubes to obtain vertex‐symmetric networks with small diameter. Telecommunication Systems 13, 135–146 (2000). https://doi.org/10.1023/A:1019135804943
Issue Date:
DOI: https://doi.org/10.1023/A:1019135804943