Graph Distances and Controllability of Networks
From MaRDI portal
Publication:2979368
DOI10.1109/TAC.2016.2546180zbMath1359.93060arXiv1608.04309OpenAlexW3099817679MaRDI QIDQ2979368
A. Yasin Yazıcıoğlu, Waseem Abbas, Magnus B. Egerstedt
Publication date: 3 May 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1608.04309
Small world graphs, complex networks (graph-theoretic aspects) (05C82) Controllability (93B05) Distance in graphs (05C12)
Related Items (8)
Almost equitable partitions and controllability of leader-follower multi-agent systems ⋮ Graph-theoretic approaches for analyzing the resilience of distributed control systems: a tutorial and survey ⋮ Controllability of networked systems with heterogeneous dynamics ⋮ On the herdability of linear time-invariant systems with special topological structures ⋮ A separation theorem for joint sensor and actuator scheduling with guaranteed performance bounds ⋮ Characterizing controllable subspace and herdability of signed weighted networks via graph partition ⋮ Strong structural controllability of networks: comparison of bounds using distances and zero forcing ⋮ Edge controllability of signed networks
This page was built for publication: Graph Distances and Controllability of Networks
