Edges deletion problem of hypercube graphs for some n

DOI10.1142/S1793830924500459MaRDI QIDQ6983262zbMATH OpenFDO

Authors Anwar N. Jasim, Alaa A. Najim

Publication date 15 May 2025

Published in Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/S1793830924500459

zbMATH Keywords

hypercube graphmaximum diameteredges deletion problem

Mathematics Subject Classification ID

Applications of graph theory (05C90) Graph algorithms (graph-theoretic aspects) (05C85) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites work

• scientific article; zbMATH DE number 3510348 (Why is no real title available?)
• Changing and unchanging the diameter of a hypercube
• Complexity and algorithms for constant diameter augmentation problems
• Cycles in folded hypercubes
• Diameter variability of hypercubes
• Diameter-invariant graphs
• Edge deletion preserving the diameter of the hypercube
• Extraconnectivity of hypercubes. II
• Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
• Large fault-tolerant interconnection networks
• Minimum cutsets in hypercubes
• Some exact values for \(p(t,d)\)
• Structure connectivity of hypercubes
• Subcube fault-tolerance in hypercubes
• The vulnerability of the diameter of folded \(n\)-cubes

This page was built for publication: Edges deletion problem of hypercube graphs for some \(n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6983262)