On Group Graphs and Their Fault Tolerance

DOI10.1109/TC.1987.1676983MaRDI QIDQ3783228zbMATH OpenOpenAlexFDO

Authors 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

distributed architecturesfault-tolerant networksgroup graphsinterconnection networksnode-symmetric graphsprocessor arrays

Mathematics Subject Classification ID

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

Recommendations

• A group-theoretic model for symmetric interconnection networks
• Large fault-tolerant interconnection networks
• Vertex fault tolerance of \(G(G_0,G_1;M)\) networks with respect to maximally connectivity
• Connectivity, persistence and fault diagnosis of interconnection networks based on \(O_ k\) and \(2O_ k\) graphs
• Fault tolerance of the star graph interconnection network

Cited in

(39)

• Large fault-tolerant interconnection networks
• Small cutsets in quasiminimal Cayley graphs
• Decomposing a star graph into disjoint cycles
• 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
• On the fault-diameter of the star graph
• Fault tolerance of the star graph interconnection network
• A depth-first search routing algorithm for star graphs and its performance evaluation
• Minimum time broadcast in faulty star networks
• On strong Menger-connectivity of star graphs
• 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
• Vertex-disjoint spanning trees of the star network with applications to fault-tolerance and security
• A note on an optimal result on fault-tolerant cycle-embedding in alternating group graphs
• Using semidirect products of groups to build classes of interconnection networks
• Fault tolerant routing in the star and pancake interconnection networks
• Topological properties of star graphs
• 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.
• The cube-of-rings interconnection network
• Connectivity of the crossed cube
• Approximating fault-tolerant group-Steiner problems
• Graph theory and interconnection networks.
• A group-theoretic model for symmetric interconnection networks
• Theg-network and its inherent fault tolerant properties
• scientific article; zbMATH DE number 1179973 (Why is no real title available?)
• Exposing graph uniformities via algebraic specification
• LOAD BALANCING, SELECTION AND SORTING ON THE STAR AND PANCAKE INTERCONNECTION NETWORKS∗
• scientific article; zbMATH DE number 842893 (Why is no real title available?)
• Product networks:a family of symmetric interconnection networks from a group model
• On the diameter and bisector size of Cayley graphs
• Broadcasting in star graphs with Byzantine failures
• Optimal time broadcasting in faulty star networks
• A grid embedding into the star graph for image analysis solutions
• Fault tolerance of vertex pancyclicity in alternating group graphs

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

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