Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary n-cube with faulty edges

DOI10.1007/S11464-013-0344-4zbMATH Open1307.05131OpenAlexW2160562473MaRDI QIDQ2258909FDOQ2258909

Authors: Xiebin Chen 

Publication date: 27 February 2015

Published in: Frontiers of Mathematics in China (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11464-013-0344-4

Recommendations

• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges
• Fault-free cycles passing through prescribed a linear forest in a hypercube with faulty edges.
• Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges

zbMATH Keywords

Hamiltonian cyclefault-toleranceinterconnection networklinear forest3-ary \(n\)-cube

Mathematics Subject Classification ID

Deterministic network models in operations research (90B10) Small world graphs, complex networks (graph-theoretic aspects) (05C82) Eulerian and Hamiltonian graphs (05C45) Paths and cycles (05C38)

Cites Work

• Survey on path and cycle embedding in some networks
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Algorithms and Computation
• Embedding of cycles in twisted cubes with edge-pancyclic
• Fault-free cycles passing through prescribed paths in hypercubes with faulty edges
• Pancyclicity of ternary \(n\)-cube networks under the conditional fault model
• Hamiltonian Cycles with Prescribed Edges in Hypercubes
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Cycles passing through a prescribed path in a hypercube with faulty edges
• Path embeddings in faulty 3-ary \(n\)-cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• 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
• Hamiltonian paths with prescribed edges in hypercubes
• Cycles passing through prescribed edges in a hypercube with some faulty edges
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• The paths embedding of the arrangement graphs with prescribed vertices in given position

Cited In (12)

• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
• The embedding cycle in 3-ary \(n\) cubes with conditional fault edges
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Hamiltonian cycles through prescribed edges in \(k\)-ary \(n\)-cubes
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• A type of perfect matchings extend to Hamiltonian cycles in \(k\)-ary \(n\)-cubes
• A fault-free Hamiltonian cycle passing through prescribed edges in a hypercube with faulty edges
• Matchings extend to Hamiltonian cycles in hypercubes with faulty edges
• Hamiltonian paths and Hamiltonian cycles passing through prescribed linear forests in star graph with fault-tolerant edges
• A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges

This page was built for publication: Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2258909)