FAULT RESILIENCY OF CAYLEY GRAPHS GENERATED BY TRANSPOSITIONS

DOI10.1142/S0129054107005108zbMath1202.68275MaRDI QIDQ3065613

László Lipták, Eddie Cheng

Publication date: 6 January 2011

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

Cayley graphsconnectivityinterconnection networks

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Reliability analysis of the cactus-based networks ⋮ LINEARLY MANY FAULTS IN (n, k)-STAR GRAPHS ⋮ Reliability evaluation of modified bubble-sort graph networks based on structure fault pattern ⋮ Linearly many faults in arrangement graphs ⋮ A Brief Account on the Development and Future Research Directions of Connectivity Properties of Interconnection Networks ⋮ Equal relation between \(g\)-good-neighbor diagnosability under the PMC model and \(g\)-good-neighbor diagnosability under the MM\(^\ast\) model of a graph ⋮ Conditional connectivity of bubble sort graphs ⋮ The extendability of Cayley graphs generated by transpositions ⋮ A kind of conditional connectivity of transposition networks generated by \(k\)-trees ⋮ A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees ⋮ The conditional fault diagnosability of \((n, k)\)-star graphs ⋮ A note on characterization of the induced matching extendable Cayley graphs generated by transpositions ⋮ Linearly many faults in Cayley graphs generated by transposition triangle free unicyclic graphs ⋮ The 3-good-neighbor connectivity of modified bubble-sort graphs ⋮ Conditional diagnosability of Cayley graphs generated by wheel graphs under the PMC model ⋮ Linearly many faults in Cayley graphs generated by transposition trees ⋮ Conditional diagnosability of multiprocessor systems based on Cayley graphs generated by transpositions ⋮ A kind of conditional connectivity of Cayley graphs generated by unicyclic graphs ⋮ Fault diagnosability of arrangement graphs ⋮ Conditional fault diagnosis of hierarchical hypercubes ⋮ Orienting Cayley graphs generated by transposition trees ⋮ THE Q_n,k,m GRAPH: A COMMON GENERALIZATION OF VARIOUS POPULAR INTERCONNECTION NETWORKS ⋮ Reliability analysis of Cayley graphs generated by transpositions ⋮ Some conditional vertex connectivities of complete-transposition graphs ⋮ On the reliability of modified bubble-sort graphs ⋮ Super \(R^k\)-vertex-connectedness ⋮ A note on generalized matching preclusion in bipartite graphs ⋮ On the edge-connectivity of graphs with two orbits of the same size ⋮ Matching preclusion for the (n, k)-bubble-sort graphs ⋮ Linearly many faults in 2-tree-generated networks ⋮ Fault-Tolerant Maximal Local-Connectivity on Cayley Graphs Generated by Transpositions ⋮ Conditional Fault Tolerance of Hypermesh Optical Interconnection Networks ⋮ Fault tolerance and diagnosability of burnt pancake networks under the comparison model

Cites Work

• Unnamed Item
• Super-connectivity and super-edge-connectivity for some interconnection networks
• Maximal vertex-connectivity of
• Hyper hamiltonian laceability of Cayley graphs generated by transpositions
• A group-theoretic model for symmetric interconnection networks
• Increasing the connectivity of the star graphs