The impact of graph symmetry on the number of driver nodes in complex networks
From MaRDI portal
Publication:2027437
DOI10.1016/j.jfranklin.2021.02.032zbMath1464.93008OpenAlexW3134799468MaRDI QIDQ2027437
Stefan Lachowicz, Hossein Parastvand, Airlie Chapman, Octavian Bass
Publication date: 26 May 2021
Published in: Journal of the Franklin Institute (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jfranklin.2021.02.032
Cites Work
- Enhancing complex network controllability by minimum link direction reversal
- Characterizing the topological and controllability features of U.S. power transmission networks
- Optimizing controllability of edge dynamics in complex networks by perturbing network structure
- \(H_\infty\) group consensus for partial-state coupled linear systems with fixed and switching topologies in the cooperation-competition networks
- Exponential synchronization for inertial coupled neural networks under directed topology via pinning impulsive control
- Controllability of undirected graphs
- Controllability and Observability of Network-of-Networks via Cartesian Products
- Distributed Control Systems for Small-Scale Power Networks: Using Multiagent Cooperative Control Theory
- Controllability of a Leader–Follower Dynamic Network With Switching Topology
- Controllability of Multi-Agent Systems from a Graph-Theoretic Perspective
- Controllability Metrics, Limitations and Algorithms for Complex Networks
This page was built for publication: The impact of graph symmetry on the number of driver nodes in complex networks