Two-node-Hamiltonicity of enhanced pyramid networks

DOI10.1016/j.ins.2010.03.006zbMath1205.68028OpenAlexW2069176708MaRDI QIDQ985080

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

zbMATH Keywords

Hamiltonian cycleinterconnection networkscycle embeddingenhanced pyramid networksfault-tolerant hamiltonicity

Mathematics Subject Classification ID

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

Related Items (2)

A systematic approach for embedding of Hamiltonian cycles through a prescribed edge in locally twisted cubes ⋮ \(\omega \)-wide diameters of enhanced pyramid networks

Cites Work

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

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