Two-node-Hamiltonicity of enhanced pyramid networks

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

Dyi-Rong Duh, Yi-Ching Chen

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 cycle; interconnection networks; cycle embedding; enhanced pyramid networks; fault-tolerant hamiltonicity

Mathematics Subject Classification ID

68M10: Network design and communication in computer systems

68R10: Graph theory (including graph drawing) in computer science

68M15: Reliability, testing and fault tolerance of networks and computer systems

05C45: Eulerian and Hamiltonian graphs

Related Items

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

• Unnamed Item
• 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
• Fault tolerance properties of pyramid networks
• Longest fault-free paths in star graphs with vertex faults