Properties of a hierarchical network based on the star graph

DOI10.1016/j.ins.2010.03.029zbMath1205.68038OpenAlexW2067433564MaRDI QIDQ985088

N. Imani, Hamid Sarbazi-Azad

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

zbMATH Keywords

pyramidinterconnection networkstopological propertiesstar graphmulticomputers

Mathematics Subject Classification ID

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

Related Items (4)

A comparative study of job allocation and migration in the pancake network ⋮ Extremal Results on Vertex and Link Residual Closeness ⋮ Geometrical analysis of physically allowed quantum cloning transformations for quantum cryptography ⋮ Some topological properties of star graphs: The surface area and volume

Cites Work

• Unnamed Item
• Embedding longest fault-free paths onto star graphs with more vertex faults
• Hyper Hamiltonian laceability on edge fault star graph
• Substar reliability analysis in star networks
• Some topological properties of star graphs: The surface area and volume
• Wormhole broadcast in star graph networks
• Minimum time broadcast in faulty star networks
• Algorithmic construction of Hamiltonians in pyramids
• Proof that pyramid networks are 1-Hamiltonian-connected with high probability
• Constructing vertex-disjoint paths in \((n, k)\)-star graphs
• Robustness of star graph network under link failure
• Capturing an Intruder in the Pyramid
• Data Movement Techniques for the Pyramid Computer
• A group-theoretic model for symmetric interconnection networks
• Lee distance and topological properties of k-ary n-cubes

This page was built for publication: Properties of a hierarchical network based on the star graph