LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
From MaRDI portal
Publication:2909108
DOI10.1142/S0129054111008994zbMath1251.68172MaRDI QIDQ2909108
László Lipták, Allen Yuan, Eddie Cheng
Publication date: 29 August 2012
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (14)
On the problem of determining which \((n, k)\)-star graphs are Cayley graphs ⋮ Parallel routing in regular networks with faults ⋮ On the conditional diagnosability of matching composition networks ⋮ On extra connectivity and extra edge-connectivity of balanced hypercubes ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ AN ADAPTIVE HEURISTIC ALGORITHM WITH THE PROBABILISTIC SAFETY VECTOR FOR FAULT-TOLERANT ROUTING ON THE (n, k)-STAR GRAPH ⋮ On strong Menger connectivity of \((n,k)\)-bubble-sort networks ⋮ Conditional fault-tolerant routing of (n,k)-star graphs ⋮ Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs ⋮ On deriving conditional diagnosability of interconnection networks ⋮ Conditional fault diagnosis of hierarchical hypercubes ⋮ Strongly Menger connectedness of data center network and \((n,k)\)-star graph ⋮ Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks ⋮ Link Failure Tolerance in the Arrangement Graphs
Cites Work
- On the connectivity and superconnected graphs with small diameter
- Super-connectivity and hyper-connectivity of vertex transitive bipartite graphs
- Vosperian and superconnected abelian Cayley digraphs
- Super-connectivity and super-edge-connectivity for some interconnection networks
- Cuts leaving components of given minimum order
- Restricted connectivity for three families of interconnection networks
- Linearly many faults in Cayley graphs generated by transposition trees
- FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS
- Circulants and their connectivities
- On the maximal connected component of a hypercube with faulty vertices III
- Synthesis of reliable networks - a survey
- On the maximal connected component of hypercube with faulty vertices (II)
- Increasing the connectivity of the star graphs
- On the maximal connected component of hypercube with faulty vertices
This page was built for publication: LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS
