Robustness of regular ring lattices based on natural connectivity

DOI10.1080/00207721003605468zbMath1242.93010arXiv0912.2144OpenAlexW1983096087MaRDI QIDQ3102805

Hongzhong Deng, Jun Wu, Yue-jin Tan, Mauricio Barahona

Publication date: 25 November 2011

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

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

zbMATH Keywords

generalized Bessel functionrobustnessrandom regular graphsnatural connectivityregular ring lattices

Mathematics Subject Classification ID

Algebraic methods (93B25) Applications of graph theory to circuits and networks (94C15) Large-scale systems (93A15)

Related Items

Scaling of weighted spectral distribution in deterministic scale-free networks ⋮ Robustness of random graphs based on graph spectra ⋮ Some bounds for total communicability of graphs ⋮ Uncertain random spectra: a new metric for assessing the survivability of mobile wireless sensor networks ⋮ Structural robustness of combat networks of weapon system-of-systems based on the operation loop ⋮ Exploring the “Middle Earth” of network spectra via a Gaussian matrix function ⋮ Accounting for the role of long walks on networks via a new matrix function ⋮ Attack and defense strategies in complex networks based on game theory ⋮ Lower bounds for Gaussian Estrada index of graphs

Cites Work

• Network robustness to targeted attacks. The interplay of expansibility and degree distribution
• On computing a conditional edge-connectivity of a graph
• Fault diameter of interconnection networks
• Eigenvalues and expanders
• Analytical and numerical results on \(M\)-variable generalized Bessel functions
• On a class of posets and the corresponding comparability graphs
• Complex networks: structure and dynamics
• Tough graphs and Hamiltonian circuits.
• Isoperimetric numbers of graphs
• Statistical mechanics of complex networks
• Vulnerability of complex networks under intentional attack with incomplete information
• Expander graphs and their applications
• Toeplitz and Circulant Matrices: A Review
• Conditional connectivity
• The Structure and Function of Complex Networks
• Congruent Graphs and the Connectivity of Graphs
• Collective dynamics of ‘small-world’ networks

This page was built for publication: Robustness of regular ring lattices based on natural connectivity