2-edge-Hamilton-connectedness of complete hypercube-like networks (Q6866675)

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

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

scientific article; zbMATH DE number 8152412

Language	Label	Description	Also known as
default for all languages	No label defined
English	2-edge-Hamilton-connectedness of complete hypercube-like networks	scientific article; zbMATH DE number 8152412

Statements

instance of

scholarly article

0 references

title

2-edge-Hamilton-connectedness of complete hypercube-like networks (English)

0 references

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

28 January 2026

0 references

zbMATH Keywords

Hamilton-connected

0 references

2-edge-Hamilton-connected

0 references

complete Josephus cube

0 references

disjoint path cover

0 references

MaRDI profile type

MaRDI publication profile

0 references

cites work

Graph theory

0 references

Vertex-independent spanning trees in complete Josephus cubes

0 references

Connectivity and diagnosability of the complete Josephus cube networks under $h$-extra fault-tolerant model

0 references

Paired many-to-many disjoint path covers in faulty hypercubes

0 references

Disjoint path covers in recursive circulants $G(2^m,4)$ with faulty elements

0 references

Paired Many-to-Many Disjoint Path Covers in Recursive Circulants $(G(2^m,4))$

0 references

Paired many-to-many disjoint path covers of hypertori

0 references

Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs

0 references

Unpaired many-to-many disjoint path covers on bipartite $k$-ary $n$-cube networks with faulty elements

0 references

Paired 2-disjoint path covers of multi-dimensional torus networks with $2n-3$ faulty edges

0 references

Evaluating the reliability of complete Josephus cubes under extra link fault with the optimal solution of the edge isoperimetric problem

0 references

The Josephus cube: A novel interconnection network

0 references

2-edge-Hamiltonian-connectedness of 4-connected plane graphs

0 references

Unpaired many-to-many disjoint path covers in restricted hypercube-like graphs

0 references

Torus-like graphs and their paired many-to-many disjoint path covers

0 references

Disjoint path covers in cubes of connected graphs

0 references

Algorithms and Computation

0 references

Disjoint path covers of star graphs

0 references

2-edge Hamiltonian connectedness: characterization and results in data center networks

0 references

Many-to-many disjoint path covers in $k$-ary $n$-cubes

0 references

Identifiers

DOI

10.1016/J.DAM.2025.11.021

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

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