Minimum cutsets in hypercubes

DOI10.1016/j.disc.2004.08.010zbMath1056.05090OpenAlexW2004949669MaRDI QIDQ1763354

Mark Ramras

Publication date: 22 February 2005

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

Full work available at URL: https://doi.org/10.1016/j.disc.2004.08.010

zbMATH Keywords

ConnectivityHypercubeDiameterEdge cutSeparating set

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40)

Related Items (3)

Connectivity of cubical polytopes ⋮ Reliability analysis and fault tolerance for hypercube multi-computer networks ⋮ The linkedness of cubical polytopes: the cube

Cites Work

• Diameter vulnerability of graphs
• Changing and unchanging the diameter of a hypercube
• Edge deletion preserving the diameter of the hypercube
• Diameter increase caused by edge deletion
• Geodetic connectivity of graphs
• Hypercube subgraphs with minimal detours
• Diameter bounds for altered graphs

This page was built for publication: Minimum cutsets in hypercubes