Proof that pyramid networks are 1-Hamiltonian-connected with high probability

Authors:
Dyi-Rong Duh;Yi-Ching Chen;Ruei-Yu Wu
Affiliations:
Department of Computer Science and Information Engineering, National Chi Nan University, Puli, Nantou Hsien 54561, Taiwan, ROC;Zinwell Corporation, Hsinchu Industrial Park, Hsinchu Hsien 30352, Taiwan, ROC;Department of Management Information Systems, Hwa Hsia Institute of Technology, Chungho City, Taipei Hsien 23568, Taiwan, ROC
Venue:
Information Sciences: an International Journal
Year:
2007

Citing 20
Cited 5

Designing efficient algorithms for parallel computers

Designing efficient algorithms for parallel computers
An efficient selection algorithm on the pyramid

Information Processing Letters
A quadtree algorithm for template matching on a pyramid computer

Theoretical Computer Science
Parallel prefix computation on a pyramid computer

Pattern Recognition Letters
Embedding pyramids into 3D meshes

Journal of Parallel and Distributed Computing
k-path partitions in trees

Discrete Applied Mathematics
Fault Tolerance Properties of Pyramid Networks

IEEE Transactions on Computers
Embedding and Reconfiguration of Spanning Trees in Faulty Hypercubes

IEEE Transactions on Parallel and Distributed Systems
9-connected claw-free graphs are Hamilton-connected

Journal of Combinatorial Theory Series B
Optimal path cover problem on block graphs

Theoretical Computer Science
Longest fault-free paths in star graphs with vertex faults

Theoretical Computer Science
Longest Fault-Free Paths in Star Graphs with Edge Faults

IEEE Transactions on Computers
Algorithmic construction of Hamiltonians in pyramids

Information Processing Letters
Image Shrinking and Expanding on a Pyramid

IEEE Transactions on Parallel and Distributed Systems
Embedding Binary X-Trees and Pyramids in Processor Arrays with Spanning Buses

IEEE Transactions on Parallel and Distributed Systems
On the k-path partition of graphs

Theoretical Computer Science
Hyper hamiltonian laceability on edge fault star graph

Information Sciences: an International Journal
Longest fault-free paths in hypercubes with vertex faults

Information Sciences: an International Journal
On embedding cycles into faulty twisted cubes

Information Sciences: an International Journal
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks

Hamiltonian connectivity of the WK-recursive network with faulty nodes

Information Sciences: an International Journal
Two-node-Hamiltonicity of enhanced pyramid networks

Information Sciences: an International Journal
Properties of a hierarchical network based on the star graph

Information Sciences: an International Journal
The 3*-connected property of pyramid networks

Computers & Mathematics with Applications
ω-wide diameters of enhanced pyramid networks

Theoretical Computer Science

Quantified Score

Hi-index	0.07

Visualization

Abstract

Wu revealed in 2001 that pyramid networks are Hamiltonian-connected. This investigation demonstrates that a pyramid network with one faulty node or one faulty edge is Hamiltonian-connected, excluding some special faulty cases by building a Hamiltonian path between any two distinct nodes in it. Although a pyramid network with one fault is not Hamiltonian-connected, this study indicates that a pyramid network is 1-Hamiltonian-connected with a very high probability.