On group graphs and their fault tolerance
IEEE Transactions on Computers
The connectivity of hierarchical Cayley digraphs
Discrete Applied Mathematics - Special double volume: interconnection networks
Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes
IEEE Transactions on Computers
Fault Tolerant Algorithms for Broadcasting on the Star Graph Network
IEEE Transactions on Computers
Cyclic-Cubes: A New Family of Interconnection Networks of Even Fixed-Degrees
IEEE Transactions on Parallel and Distributed Systems
Recursive Cube of Rings: A New Topology for Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Construction of Hamiltonian Circuits in Cayley Graphs Modeling Multiprocessing Computer Systems
Automation and Remote Control
Fault tolerance on star graphs
PAS '95 Proceedings of the First Aizu International Symposium on Parallel Algorithms/Architecture Synthesis
A new family of interconnection networks of fixed degree three
Journal of Computer Science and Technology
Cayley DHTs — a group-theoretic framework for analyzing DHTs based on cayley graphs
ISPA'04 Proceedings of the Second international conference on Parallel and Distributed Processing and Applications
| Hi-index | 14.99 |
If H is a quasiminimal generating set for a finite group G, it is proved that the Cayley graph (G; H) has optimal fault tolerance unless it belongs to a special family.