Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links
From MaRDI portal
Publication:845346
Recommendations
- Path embeddings in faulty 3-ary \(n\)-cubes
- Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
- Embedding long cycles in faulty \(k\)-ary \(2\)-cubes
- Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
Cites work
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
- Edge-fault-tolerant bipanconnectivity of hypercubes
- Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
- Embedding a fault-free Hamiltonian cycle in a class of faulty generalized honeycomb tori
- Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
- Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
- Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
- Hamiltonian connectivity of the WK-recursive network with faulty nodes
- Lee distance and topological properties of k-ary n-cubes
- Long paths in hypercubes with conditional node-faults
- Many-to-many disjoint paths in faulty hypercubes
- Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
Cited in
(33)- Hamiltonian cycles passing through linear forests in k-ary n-cubes
- Fault tolerance in k-ary n-cube networks
- The embedding cycle in 3-ary \(n\) cubes with conditional fault edges
- Fault-tolerant embedding of cycles of various lengths in k-ary n-cubes
- Conditional edge-fault pancyclicity of augmented cubes
- Conditional edge-fault Hamiltonicity of augmented cubes
- Embedding long cycles in faulty \(k\)-ary \(2\)-cubes
- Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
- Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs
- Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
- Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
- Geodesic pancyclicity of twisted cubes
- Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
- Structure fault tolerance of \(k\)-ary \(n\)-cube networks
- Pancyclicity of k-ary n-cube networks with faulty vertices and edges
- Path embeddings in faulty 3-ary \(n\)-cubes
- Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
- Cycle and Path Embedding on 5-ary N-cubes
- Pancyclicity of ternary n-cube networks under the conditional fault model
- The reliability analysis of \(k\)-ary \(n\)-cube networks
- Complete binary trees embeddings in Möbius cubes
- Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
- Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
- Embedding meshes into twisted-cubes
- Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
- The panpositionable panconnectedness of augmented cubes
- Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
- A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes
- A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Various cycles embedding in faulty balanced hypercubes
- Panconnectivity and edge-pancyclicity of k-ary n-cubes with faulty elements
- Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices
- Fault-free Hamiltonian cycles passing through a linear forest in ternary n-cubes with faulty edges
This page was built for publication: Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q845346)
