Path embeddings in faulty 3-ary n-cubes

DOI10.1016/J.INS.2009.09.007zbMATH Open1183.68093OpenAlexW2015612745MaRDI QIDQ845345FDOQ845345

Authors: Shiying Wang, Shangwei Lin 

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.007

Recommendations

• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
• Embedding long cycles in faulty \(k\)-ary \(2\)-cubes
• Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes

zbMATH Keywords

fault-toleranceinterconnection networkspanconnectivity\(k\)-ary \(n\)-cubescycle embeddingspath embeddings

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

• Lee distance and topological properties of k-ary n-cubes
• Longest fault-free paths in hypercubes with vertex faults
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• Complete path embeddings in crossed cubes
• Embedding meshes into crossed cubes
• On rank vs. communication complexity
• On the k-ary hypercube
• Mapping Cycles and Trees on Wrap-Around Butterfly Graphs

Cited In (26)

• Hamiltonian cycles passing through linear forests in \(k\)-ary \(n\)-cubes
• The embedding cycle in 3-ary \(n\) cubes with conditional fault edges
• Embedding paths and cycles in 3-ary \(n\)-cubes with faulty nodes and links
• Conditional edge-fault Hamiltonicity of augmented cubes
• Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Embedding long cycles in faulty \(k\)-ary \(2\)-cubes
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
• Panconnectivity and pancyclicity of the 3-ary \(n\)-cube network under the path restrictions
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Geodesic pancyclicity of twisted cubes
• Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Many-to-many \(n\)-disjoint path covers in \(n\)-dimensional hypercubes
• Edge-bipancyclicity in conditional edge-faulty \(k\)-ary \(n\)-cubes
• Matching preclusion for \(k\)-ary \(n\)-cubes
• Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges
• Fault-tolerant embedding of paths in crossed cubes
• Hamiltonian paths passing through prescribed edges in balanced hypercubes
• Embedding meshes into twisted-cubes
• A note on Hamiltonian paths and cycles with prescribed edges in the 3-ary \(n\)-cube
• Vertex-disjoint paths in a 3-ary \(n\)-cube with faulty vertices
• Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes
• Fault-free Hamiltonian cycles passing through a linear forest in ternary \(n\)-cubes with faulty edges
• Connectivity and super connectivity of the exchanged 3-ary \(n\)-cube

This page was built for publication: Path embeddings in faulty 3-ary \(n\)-cubes

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