Topological properties of star graphs

DOI10.1016/0898-1221(93)90188-2zbMath0771.68027OpenAlexW2076374429MaRDI QIDQ2366668

Sumit Sur, Pradip K. Srimani

Publication date: 1 September 1993

Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0898-1221(93)90188-2

zbMATH Keywords

minimal pathsnetworksrouting algorithmstopological propertiesstar graphs

Mathematics Subject Classification ID

Stochastic programming (90C15) Graph theory (including graph drawing) in computer science (68R10) Mathematical problems of computer architecture (68M07)

Related Items (9)

Minimum time broadcast in faulty star networks ⋮ Fault-Tolerance of Star Graph Based on Subgraph Fault Pattern ⋮ On strong Menger-connectivity of star graphs ⋮ Substar reliability analysis in star networks ⋮ Short containers in Cayley graphs ⋮ Relation of Extra Edge Connectivity and Component Edge Connectivity for Regular Networks ⋮ Broadcasting in hypercubes and star graphs with dynamic faults. ⋮ Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security ⋮ Optimal data exchange algorithms on star graphs

Cites Work

• Fault diameter of interconnection networks
• Parallel concepts in graph theory
• Fault-Tolerant Multiprocessor Link and Bus Network Architectures
• On Group Graphs and Their Fault Tolerance
• A group-theoretic model for symmetric interconnection networks

This page was built for publication: Topological properties of star graphs