On the Controllability Properties of Circulant Networks

DOI10.1109/TAC.2013.2259992zbMath1369.93086MaRDI QIDQ5353439

Marzieh Nabi-Abdolyousefi, Mehran Mesbahi

Publication date: 8 September 2017

Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)

Mathematics Subject Classification ID

Controllability (93B05) Applications of graph theory to circuits and networks (94C15)

Related Items (14)

Controllability of networked MIMO systems ⋮ Controllability of the multi-agent system modeled by the threshold graph with one repeated degree ⋮ A new perspective to algebraic characterization on controllability of multiagent systems ⋮ Almost equitable partitions and new necessary conditions for network controllability ⋮ The robust minimal controllability problem ⋮ Constructing a controllable graph under edge constraints ⋮ Strong structural controllability of networks ⋮ On a Conjecture of Godsil Concerning Controllable Random Graphs ⋮ A necessary and sufficient condition for the controllability of single-leader multi-chain systems ⋮ Zero forcing number, constrained matchings and strong structural controllability ⋮ Controllability of networked higher-dimensional systems with one-dimensional communication ⋮ Controllability of Kronecker product networks ⋮ Eigenvectors and controllability of non-Hermitian random matrices and directed graphs ⋮ Group controllability of discrete-time time-delayed multiagent systems with multiple leaders

This page was built for publication: On the Controllability Properties of Circulant Networks