Two-node-Hamiltonicity of enhanced pyramid networks

DOI10.1016/J.INS.2010.03.006zbMATH Open1205.68028OpenAlexW2069176708MaRDI QIDQ985080FDOQ985080

Authors: Yi-Ching Chen, Dyi-Rong Duh 

Publication date: 20 July 2010

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

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

Recommendations

• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
• Hamiltonicity of the torus network under the conditional fault model
• Fault-tolerant Hamiltonicity in a class of faulty meshes
• Hamiltonian properties of twisted hypercube-like networks with more faulty elements

zbMATH Keywords

Hamiltonian cyclecycle embeddinginterconnection networksenhanced pyramid networksfault-tolerant hamiltonicity

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Eulerian and Hamiltonian graphs (05C45) Reliability, testing and fault tolerance of networks and computer systems (68M15) Network design and communication in computer systems (68M10)

Cites Work

• Fault-free Hamiltonian cycles in crossed cubes with conditional link faults
• Fault-tolerant cycle-embedding in alternating group graphs
• Longest fault-free paths in hypercubes with vertex faults
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Fault Hamiltonicity and fault Hamiltonian connectivity of the (n,k)-star graphs
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Longest fault-free paths in star graphs with vertex faults
• Diagonal and toroidal mesh networks
• Embedding Hamiltonian cycles in alternating group graphs under conditional fault model
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Fault tolerance properties of pyramid networks
• Algorithmic construction of Hamiltonians in pyramids
• Constructing the nearly shortest path in crossed cubes
• Data Movement Techniques for the Pyramid Computer
• A note on time-bounded bottom-up pyramid cellular acceptors
• Diameter variability of cycles and tori
• Construction schemes for fault-tolerant Hamiltonian graphs

Cited In (7)

• \(\omega \)-wide diameters of enhanced pyramid networks
• A bypassing path based routing algorithm for the pyramid structures
• The triangular pyramid: Routing and topological properties
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Algorithmic construction of Hamiltonians in pyramids
• A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes

This page was built for publication: Two-node-Hamiltonicity of enhanced pyramid networks

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