The maximum number of disjoint paths in faulty enhanced hypercubes
From MaRDI portal
Publication:5243994
zbMATH Open1428.05140MaRDI QIDQ5243994FDOQ5243994
Authors: Dan Jin, Hongmei Liu 
Publication date: 19 November 2019
Recommendations
- Edge disjoint paths in enhanced hypercube with conditional faults
- Many-to-many disjoint paths in faulty hypercubes
- Many-to-many disjoint paths in hypercubes with faulty vertices
- Paths and cycles embedding on faulty enhanced hypercube networks
- Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Enumeration in graph theory (05C30) Paths and cycles (05C38) Hypergraphs (05C65)
Cited In (5)
- Vertex-disjoint paths joining adjacent vertices in faulty hypercubes
- The vulnerability of the diameter of the enhanced hypercubes
- An algorithm on disjoint paths in enhanced hypercubes
- Many-to-many edge-disjoint paths in \((n,k)\)-enhanced hypercube under three link-faulty hypotheses
- Edge disjoint paths in enhanced hypercube with conditional faults
This page was built for publication: The maximum number of disjoint paths in faulty enhanced hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5243994)
