Changing and unchanging the diameter of a hypercube

DOI10.1016/0166-218X(92)90137-YzbMath0756.94021MaRDI QIDQ1199429

Frank Harary, Niall Graham

Publication date: 16 January 1993

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

hypercubegraphfaultsparallel computernetwork of processorsbroadcast trees

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15)

Related Items (10)

Edge deletion preserving the diameter of the hypercube ⋮ Some small sized spanning subgraphs of a hypercube ⋮ Some diameter notions of Fibonacci cubes ⋮ Diameter variability of cycles and tori ⋮ Bounded edge-connectivity and edge-persistence of Cartesian product of graphs ⋮ Minimum cutsets in hypercubes ⋮ Diameter variability of hypercubes ⋮ Unchanging the diameter ofk-aryn-cube networks with faulty vertices ⋮ Changing the diameter of the locally twisted cube ⋮ Some diameter notions in lexicographic product of graphs

Cites Work

• Some small sized spanning subgraphs of a hypercube
• A decomposition theorem for partially ordered sets
• A data structure for manipulating priority queues
• Diameters in graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Changing and unchanging the diameter of a hypercube