Path embeddings in faulty 3-ary n-cubes

DOI10.1016/J.INS.2009.09.007MaRDI QIDQ845345zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

\(k\)-ary \(n\)-cubescycle embeddingsfault-toleranceinterconnection networkspanconnectivitypath embeddings

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(27)

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

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)