Synchronizability of random rectangular graphs
From MaRDI portal
Publication:4591721
DOI10.1063/1.4928333zbMath1374.34204OpenAlexW1572229104WikidataQ50860712 ScholiaQ50860712MaRDI QIDQ4591721
Ernesto Estrada, Guan-Rong Chen
Publication date: 17 November 2017
Published in: Chaos: An Interdisciplinary Journal of Nonlinear Science (Search for Journal in Brave)
Full work available at URL: https://strathprints.strath.ac.uk/54650/
Random graphs (graph-theoretic aspects) (05C80) Ordinary differential equations and systems with randomness (34F05) Asymptotic properties of solutions to ordinary differential equations (34D05)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- \(\lambda_ 1\), isoperimetric inequalities for graphs, and superconcentrators
- Emergence of Scaling in Random Networks
- SYNCHRONIZATION IN RANDOM GEOMETRIC GRAPHS
- Random Geometric Graphs
- Deterministic Nonperiodic Flow
- Synchronization in complex oscillator networks and smart grids
- Fundamentals of Complex Networks
- Network synchronizability analysis: A graph-theoretic approach
- Synchronization in scale-free dynamical networks: robustness and fragility
- Collective dynamics of ‘small-world’ networks
This page was built for publication: Synchronizability of random rectangular graphs