Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
From MaRDI portal
Publication:279915
DOI10.1016/j.amc.2014.05.125zbMath1335.68185OpenAlexW2094124643MaRDI QIDQ279915
Jing Li, Yuxing Yang, Shi-ying Wang
Publication date: 29 April 2016
Published in: Applied Mathematics and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.amc.2014.05.125
Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83)
Related Items
Hamiltonian paths passing through prescribed edges in balanced hypercubes ⋮ Embedding various cycles with prescribed paths into \(k\)-ary \(n\)-cubes
Cites Work
- Unnamed Item
- Unnamed Item
- Bipanconnectivity of faulty hypercubes with minimum degree
- Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
- Embedding a Hamiltonian cycle in the crossed cube with two required vertices in the fixed positions
- Fault-tolerant edge and vertex pancyclicity in alternating group graphs
- Fault tolerance of vertex pancyclicity in alternating group graphs
- Cycles passing through a prescribed path in a hypercube with faulty edges
- Path embeddings in faulty 3-ary \(n\)-cubes
- Path bipancyclicity of hypercubes
- A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
- On path bipancyclicity of hypercubes
- Hamiltonian paths and cycles passing through a prescribed path in hypercubes
- Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
- Pancyclicity of ternary \(n\)-cube networks under the conditional fault model
- Edge-pancyclicity and path-embeddability of bijective connection graphs
- Hamiltonian cycles and paths with a prescribed set of edges in hypercubes and dense sets
- Lee distance and topological properties of k-ary n-cubes
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
