On Group Graphs and Their Fault Tolerance

DOI10.1109/TC.1987.1676983zbMath0641.94049OpenAlexW1998071402MaRDI QIDQ3783228

S. B. Akers, Balakrishnan Krishnamurthy

Publication date: 1987

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.1987.1676983

zbMATH Keywords

interconnection networksfault-tolerant networksdistributed architecturesprocessor arraysgroup graphsnode-symmetric graphs

Mathematics Subject Classification ID

Applications of graph theory to circuits and networks (94C15) Theory of software (68N99)

Related Items (30)

A depth-first search routing algorithm for star graphs and its performance evaluation ⋮ Fault tolerant routing in the star and pancake interconnection networks ⋮ Topological properties of star graphs ⋮ Connectivity of the crossed cube ⋮ On the diameter and bisector size of Cayley graphs ⋮ LOAD BALANCING, SELECTION AND SORTING ON THE STAR AND PANCAKE INTERCONNECTION NETWORKS∗ ⋮ Theg-network and its inherent fault tolerant properties ⋮ Large fault-tolerant interconnection networks ⋮ Small cutsets in quasiminimal Cayley graphs ⋮ Minimum time broadcast in faulty star networks ⋮ Using semidirect products of groups to build classes of interconnection networks ⋮ On strong Menger-connectivity of star graphs ⋮ THE CUBE-OF-RINGS INTERCONNECTION NETWORK ⋮ Decomposing a star graph into disjoint cycles ⋮ A grid embedding into the star graph for image analysis solutions ⋮ Dense group networks ⋮ Stirling networks: A versatile combinatorial topology for multiprocessor systems ⋮ Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs ⋮ The connectivity of hierarchical Cayley digraphs ⋮ Processor interconnection networks from Cayley graphs ⋮ Product networks:a family of symmetric interconnection networks from a group model ⋮ On the fault-diameter of the star graph ⋮ Exposing graph uniformities via algebraic specification ⋮ Recursive circulants and their embeddings among hypercubes ⋮ On the fault-tolerant embedding of complete binary trees in the pancake graph interconnection network ⋮ Symmetric failures in symmetric control systems ⋮ Application of the special Latin square to a parallel routing algorithm on a recursive circulant network. ⋮ Broadcasting in hypercubes and star graphs with dynamic faults. ⋮ Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security ⋮ Fault tolerance of the star graph interconnection network

This page was built for publication: On Group Graphs and Their Fault Tolerance