Fault-tolerant Hamiltonicity of twisted cubes
From MaRDI portal
(Redirected from Publication:697012)
Recommendations
Cited in
(44)- Ring embedding in faulty pancake graphs
- A hypercube variant with small diameter
- Efficient unicast in bijective connection networks with the restricted faulty node set
- RVCCC: a new variational network of cube-connected cycles and its topological properties
- DVcube: a novel compound architecture of disc-ring graph and hypercube-like graph
- Survey on path and cycle embedding in some networks
- Fault-tolerant Hamiltonian connectivity of the WK-recursive networks
- Embedding a family of meshes into twisted cubes
- An efficient fault-tolerant routing algorithm in bijective connection networks with restricted faulty edges
- A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees
- The two-equal-disjoint path cover problem of matching composition network
- Geodesic pancyclicity of twisted cubes
- Independent spanning trees on twisted cubes
- Edge-pancyclicity and Hamiltonian connectivity of twisted cubes
- Hybrid fault-tolerant prescribed hyper-Hamiltonian laceability of hypercubes
- Edge-fault-tolerant node-pancyclicity of twisted cubes
- Fractional matching preclusion of graphs
- Hamiltonian properties of twisted hypercube-like networks with more faulty elements
- Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
- Cubic planar Hamiltonian graphs of various types
- Hamiltonian cycles and paths in faulty twisted hypercubes
- One-to-one communication in twisted cubes under restricted connectivity
- The fault-diameter and wide-diameter of twisted hypercubes
- The family of generalized variational network of cube-connected cycles
- On the extremal number of edges in Hamiltonian connected graphs
- Conditional fault hamiltonian connectivity of the complete graph
- One-to-one conditional path covers on augmented cubes
- Integer \(k\)-matching preclusion of twisted cubes and \((n,s)\)-star graphs
- Fault-tolerant Hamiltonian connectedness of cycle composition networks
- Vertex-pancyclicity of twisted cubes with maximal faulty edges
- Fault-tolerant hamiltonicity and fault-tolerant hamiltonian connectivity of the folded Petersen cube networks
- Embedding two edge-disjoint Hamiltonian cycles into locally twisted cubes
- A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
- Constructing edge-disjoint spanning trees in twisted cubes
- Embedding of cycles in twisted cubes with edge-pancyclic
- The Hamiltonian connectivity of rectangular supergrid graphs
- On embedding cycles into faulty twisted cubes
- Locally twisted cubes are 4-pancyclic.
- Edge-fault-tolerant hamiltonicity of locally twisted cubes under conditional edge faults
- On some super fault-tolerant Hamiltonian graphs
- The property of edge-disjoint Hamiltonian cycles in transposition networks and hypercube-like networks
- A recursively construction scheme for super fault-tolerant Hamiltonian graphs
- Fault-tolerant pancyclicity of augmented cubes
- Paths and cycles identifying vertices in twisted cubes
This page was built for publication: Fault-tolerant Hamiltonicity of twisted cubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q697012)
