The triangular pyramid: Routing and topological properties

DOI10.1016/J.INS.2010.02.016zbMATH Open1200.68039OpenAlexW2078601125MaRDI QIDQ985070FDOQ985070

Authors: J. Martínez 

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.02.016

Recommendations

• Some new topological properties of the triangular pyramid networks
• Properties of a hierarchical network based on the star graph
• Algorithmic construction of Hamiltonians in pyramids
• Routing on Triangles, Tori and Honeycombs
• Two-node-Hamiltonicity of enhanced pyramid networks

zbMATH Keywords

pyramidcycle embeddinginterconnection networkroutingtriangular meshtriangular pyramidHamiltonian properties

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Edge-fault-tolerant bipanconnectivity of hypercubes
• Long paths in hypercubes with conditional node-faults
• Many-to-many disjoint paths in faulty hypercubes
• Some topological properties of star graphs: The surface area and volume
• Node-disjoint paths in hierarchical hypercube networks
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Pruned three-dimensional toroidal networks
• The bipancycle-connectivity of the hypercube
• On reliability of the folded hypercubes
• On conditional diagnosability of the folded hypercubes
• Robustness of star graph network under link failure
• Substar reliability analysis in star networks
• Embedding a family of disjoint 3D meshes into a crossed cube
• Hamiltonian connectivity of the WK-recursive network with faulty nodes
• Fault tolerance properties of pyramid networks
• Algorithmic construction of Hamiltonians in pyramids
• Constructing the nearly shortest path in crossed cubes
• Data Movement Techniques for the Pyramid Computer
• Simulation of binary trees and \(X\)-trees on pyramid networks

Cited In (8)

• Three Types of Network Complexity Pyramid
• Some new topological properties of the triangular pyramid networks
• Topological properties on the diameters of the integer simplex
• A bypassing path based routing algorithm for the pyramid structures
• Hamiltonicity of the basic WK-recursive pyramid with and without faulty nodes
• Hamiltonian properties of honeycomb meshes
• Distributed Computing - IWDC 2004
• Properties of a hierarchical network based on the star graph

This page was built for publication: The triangular pyramid: Routing and topological properties

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