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

DOI10.1016/J.INS.2007.03.013MaRDI QIDQ2384537zbMATH OpenOpenAlexFDO

Authors Dyi-Rong Duh, Yi-Ching Chen, Ruei-Yu Wu

Publication date 10 October 2007

Published in Information Sciences (Search for Journal in Brave)

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

zbMATH Keywords

fault-tolerant embeddingHamiltonian connectednessinterconnection networkspyramid networks

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Two-node-Hamiltonicity of enhanced pyramid networks
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Hamiltonian connectivity of restricted hypercube-like networks under the conditional fault model
• Fault Hamiltonicity and fault Hamiltonian-connectivity of generalised matching networks

Cites work

• 9-connected claw-free graphs are Hamilton-connected
• \(k\)-path partitions in trees
• A quadtree algorithm for template matching on a pyramid computer
• A textbook of graph theory
• Algorithmic construction of Hamiltonians in pyramids
• An efficient selection algorithm on the pyramid
• Embedding longest fault-free paths in arrangement graphs with faulty vertices
• Fault tolerance properties of pyramid networks
• Hamiltonian paths in oriented graphs
• scientific article; zbMATH DE number 4033059 (Why is no real title available?)
• scientific article; zbMATH DE number 2010366 (Why is no real title available?)
• Hyper Hamiltonian laceability on edge fault star graph
• Longest fault-free paths in hypercubes with vertex faults
• Longest fault-free paths in star graphs with vertex faults
• On embedding cycles into faulty twisted cubes
• On the \(k\)-path partition of graphs.
• Optimal path cover problem on block graphs
• The effects of distance and neighborhood union conditions on hamiltonian properties in graphs

Cited in

(8)

• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• The spanning laceability on the faulty bipartite hypercube-like networks
• On the strong distance problems of pyramid networks
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
• -wide diameters of enhanced pyramid networks
• The \(3^{*}\)-connected property of pyramid networks
• Two-node-Hamiltonicity of enhanced pyramid networks
• Properties of a hierarchical network based on the star graph

This page was built for publication: Proof that pyramid networks are 1-Hamiltonian-connected with high probability

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