2-edge-Hamilton-connectedness of complete hypercube-like networks

DOI10.1016/J.DAM.2025.11.021MaRDI QIDQ6866675zbMATH OpenFDO

Authors Huimei Guo, Rong-Xia Hao, Jou-Ming Chang

Publication date 28 January 2026

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

Full work available at URL https://doi.org/10.1016/J.DAM.2025.11.021

zbMATH Keywords

2-edge-Hamilton-connectedcomplete Josephus cubedisjoint path coverHamilton-connected

Mathematics Subject Classification ID

Eulerian and Hamiltonian graphs (05C45) Small world graphs, complex networks (graph-theoretic aspects) (05C82)

Cites work

• 2-edge Hamiltonian connectedness: characterization and results in data center networks
• 2-edge-Hamiltonian-connectedness of 4-connected plane graphs
• Algorithms and Computation
• Connectivity and diagnosability of the complete Josephus cube networks under h-extra fault-tolerant model
• Disjoint path covers in cubes of connected graphs
• Disjoint path covers in recursive circulants G(2ᵐ,4) with faulty elements
• Disjoint path covers of star graphs
• Evaluating the reliability of complete Josephus cubes under extra link fault with the optimal solution of the edge isoperimetric problem
• Graph theory
• Many-to-many disjoint path covers in k-ary n-cubes
• Paired 2-disjoint path covers of multi-dimensional torus networks with \(2n-3\) faulty edges
• Paired many-to-many disjoint path covers in faulty hypercubes
• Paired Many-to-Many Disjoint Path Covers in Recursive Circulants (G(2ᵐ,4))
• Paired many-to-many disjoint path covers of hypertori
• The Josephus cube: A novel interconnection network
• Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs
• Torus-like graphs and their paired many-to-many disjoint path covers
• Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs
• Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements
• Vertex-independent spanning trees in complete Josephus cubes

This page was built for publication: 2-edge-Hamilton-connectedness of complete hypercube-like networks

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