Hamiltonian path embeddings in conditional faulty k-ary n-cubes

DOI10.1016/J.INS.2014.01.044zbMATH Open1341.68139OpenAlexW1975413980MaRDI QIDQ726167FDOQ726167

Authors: Shurong Zhang, Yuxing Yang, Shiying Wang 

Publication date: 8 July 2016

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

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

Recommendations

• Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
• Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Edge-bipancyclicity in conditional edge-faulty \(k\)-ary \(n\)-cubes
• Path embeddings in faulty 3-ary \(n\)-cubes

zbMATH Keywords

Hamiltonian path\(k\)-ary \(n\)-cubeinterconnection networkpath embeddingconditional edge fault

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Paths and cycles (05C38) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• Graph theory
• Paired many-to-many disjoint path covers of the hypercubes
• A group-theoretic model for symmetric interconnection networks
• Many-to-many disjoint path covers in \(k\)-ary \(n\)-cubes
• Fault-tolerant embedding of cycles of various lengths in \(k\)-ary \(n\)-cubes
• Paired 2-disjoint path covers and strongly Hamiltonian laceability of bipartite hypercube-like graphs
• Edge-bipancyclicity of the \(k\)-ary \(n\)-cubes with faulty nodes and edges
• A note on fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
• Path embeddings in faulty 3-ary \(n\)-cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Communication algorithms in \(k\)-ary \(n\)-cube interconnection networks
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes
• Panconnectivity and edge-pancyclicity of \(k\)-ary \(n\)-cubes with faulty elements
• Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
• Pancyclicity of \(k\)-ary \(n\)-cube networks with faulty vertices and edges

Cited In (12)

• Embedding Hamiltonian paths in \(k\)-ary \(n\)-cubes with conditional edge faults
• Embedding fault-free Hamiltonian paths with prescribed linear forests into faulty ternary \(n\)-cubes
• Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
• Strongly Hamiltonian laceability of the even \(k\)-ary \(n\)-cube
• Structure fault tolerance of \(k\)-ary \(n\)-cube networks
• Path embeddings in faulty 3-ary \(n\)-cubes
• Edge-bipancyclicity in conditional edge-faulty \(k\)-ary \(n\)-cubes
• Hamiltonian circuit and linear array embeddings in faulty \(k\)-ary \(n\)-cubes
• Fault-Tolerant Embeddings of Hamiltonian Circuits in k-ary n-Cubes
• The reliability analysis of \(k\)-ary \(n\)-cube networks
• Structure connectivity and substructure connectivity of \(k\)-ary \(n\)-cube networks
• Odd cycles embedding on folded hypercubes with conditional faulty edges

This page was built for publication: Hamiltonian path embeddings in conditional faulty \(k\)-ary \(n\)-cubes

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