Fault tolerant supergraphs with automorphisms

DOI10.1016/j.dam.2018.06.012zbMath1404.05199arXiv1604.04855OpenAlexW2962714526MaRDI QIDQ1720338

Ashwin Ganesan

Publication date: 8 February 2019

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1604.04855

zbMATH Keywords

permutation groupsinterconnection networksgraph automorphismsfault-tolerant system designstructural fault tolerance

Mathematics Subject Classification ID

Small world graphs, complex networks (graph-theoretic aspects) (05C82) Graph theory (05C99)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Data center interconnection networks are not hyperbolic
• Edge-transitivity of Cayley graphs generated by transpositions
• Automorphism groups of Cayley graphs generated by connected transposition sets
• Automorphism groups of the Pancake graphs
• Automorphism group of the complete transposition graph
• A kind of conditional vertex connectivity of star graphs
• Designing fault-tolerant systems using automorphisms
• Transitivity of permutation groups on unordered sets
• Automorphism groups of Cayley graphs on symmetric groups with generating transposition sets
• A Graph Model for Fault-Tolerant Computing Systems