Algorithmic construction of Hamiltonians in pyramids

DOI10.1016/S0020-0190(01)00149-1zbMath1032.68004OpenAlexW2076965155MaRDI QIDQ1603354

Lewis M. Mackenzie, Hamid Sarbazi-Azad, Mohamed Ould-Khaoua

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(01)00149-1

zbMATH Keywords

Hamiltonian cycleHamiltonian pathInterconnection networksEmbeddingPyramid

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10)

Related Items (6)

Proof that pyramid networks are 1-Hamiltonian-connected with high probability ⋮ The \(3^{*}\)-connected property of pyramid networks ⋮ The triangular pyramid: Routing and topological properties ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Properties of a hierarchical network based on the star graph ⋮ Fractional matching preclusion for radix triangular mesh

Cites Work

• Unnamed Item
• Data Movement Techniques for the Pyramid Computer
• On the Existence of Hamiltonian Circuits in Faulty Hypercubes
• Lee distance and topological properties of k-ary n-cubes
• Fault tolerance properties of pyramid networks

This page was built for publication: Algorithmic construction of Hamiltonians in pyramids