Embedding paths and cycles in 3-ary n-cubes with faulty nodes and links

DOI10.1016/J.INS.2009.09.002zbMATH Open1183.68089OpenAlexW2066050542MaRDI QIDQ845346FDOQ845346

Xiaofan Yang, Dajin Wang, Qiang Dong

Publication date: 28 January 2010

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.09.002

zbMATH Keywords

embeddingfault-tolerance\(k\)-ary \(n\)-cubecycleinterconnection networkspath

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14)

Cites Work

• Title not available (Why is that?)
• Edge-fault-tolerant bipanconnectivity of hypercubes
• Long paths in hypercubes with conditional node-faults
• Conditional edge-fault-tolerant edge-bipancyclicity of hypercubes
• Lee distance and topological properties of k-ary n-cubes
• Many-to-many disjoint paths in faulty hypercubes
• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements
• 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
• Hamiltonian connectivity of the WK-recursive network with faulty nodes

Cited In (26)

• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• Conditional edge-fault Hamiltonicity of augmented cubes
• Conditional edge-fault pancyclicity of augmented 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
• Structure fault tolerance of \(k\)-ary \(n\)-cube networks
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Geodesic pancyclicity of twisted cubes
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges
• 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
• Exact Wirelength of Embedding 3-Ary n-Cubes into Certain Cylinders and Trees
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
• 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
• 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)