\(\omega \)-wide diameters of enhanced pyramid networks

DOI10.1016/j.tcs.2011.03.026zbMath1217.68037OpenAlexW2076203895MaRDI QIDQ551195

Dyi-Rong Duh, Hsien-Jone Hsieh

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.03.026

zbMATH Keywords

containerfault toleranceinterconnection networkswide diameternode-disjoint pathsenhanced pyramid networkspyramid networks

Mathematics Subject Classification ID

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

Related Items (2)

The vulnerability of the diameter of the enhanced hypercubes ⋮ On the strong distance problems of pyramid networks

Cites Work

• Weak-vertex-pancyclicity of (\(n,k\))-star graphs
• Fault-free Hamiltonian cycles in twisted cubes with conditional link faults
• Two-node-Hamiltonicity of enhanced pyramid networks
• Conditional edge-fault Hamiltonicity of augmented cubes
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Generalized diameters of the mesh of trees
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Strong Rabin numbers of folded hypercubes
• w -Rabin numbers and strong w -Rabin numbers of folded hypercubes
• Constructing one-to-many disjoint paths in folded hypercubes
• Fault tolerance properties of pyramid networks
• Node‐disjoint paths and related problems on hierarchical cubic networks

This page was built for publication: \(\omega \)-wide diameters of enhanced pyramid networks