Edge Deletion Preserving the Diameter of the Hypercube

Abstract We give upper and lower bounds to the number un− (Qn) of edges that one can remove from a hypercube without altering its diameter, namely: (n − 2)2 n − 1 − ( n ⌊ n 2 ⌋) + 2 ⩽ un − (Q n ) ⩽(n − 2)2 n − 1 + 1 − ⌈ (2 n − 1) (2n − 1) ⌉ .

[1]  Peter Freebody,et al.  Research Report No. 1 , 1989 .

[2]  Charles Delorme,et al.  Strategies for Interconnection Networks: Some Methods from Graph Theory , 1986, J. Parallel Distributed Comput..

[3]  Claude Berge,et al.  Graphs and Hypergraphs , 2021, Clustering.

[4]  Frank Harary,et al.  Changing and Unchanging the Diameter of a Hypercube , 1992, Discret. Appl. Math..