Automorphism groups, isomorphism, reconstruction*
Automorphism groups, isomorphism, reconstruction*
Network robustness and graph topology
ACSC '04 Proceedings of the 27th Australasian conference on Computer science - Volume 26
Simulating network robustness for critical infrastructure networks
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Simulating network robustness for critical infrastructure networks
ACSC '05 Proceedings of the Twenty-eighth Australasian conference on Computer Science - Volume 38
Comparison of network criticality, algebraic connectivity, and other graph metrics
Proceedings of the 1st Annual Workshop on Simplifying Complex Network for Practitioners
Autonomic traffic engineering for network robustness
IEEE Journal on Selected Areas in Communications
The Maximum Degree & Diameter-Bounded Subgraph and its Applications
Journal of Mathematical Modelling and Algorithms
DVcube: A novel compound architecture of disc-ring graph and hypercube-like graph
Theoretical Computer Science
Endurance: A new robustness measure for complex networks under multiple failure scenarios
Computer Networks: The International Journal of Computer and Telecommunications Networking
| Hi-index | 0.00 |
In this paper, we introduce a new measure of symmetry which we call the symmetry ratio of a network, defined to be the ratio of the number of distinct eigenvalues of the network to D+1, where D is the diameter. The symmetry ratio has utility in partially predicting the robustness of a network in the face of attack. We prove a number of results placing bounds on the symmetry ratio for several families of networks, including distance-transitive networks, prisms, twisted prisms, antiprisms, tori, Cayley graphs, and random graphs.