Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs

From MaRDI portal
Revision as of 21:04, 3 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:2983053

DOI10.1109/TAC.2014.2308619zbMath1360.93102arXiv1403.4868OpenAlexW2023351932MaRDI QIDQ2983053

Nima Monshizadeh, Shuo Zhang, M. Kanat Camlibel

Publication date: 16 May 2017

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

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




Related Items (22)

Leader selection for strong structural controllability of single-integrator multi-agent systemsPartial strong structural controllabilityGroup controllability of discrete-time multi-agent systemsAlmost equitable partitions and new necessary conditions for network controllabilityGroup controllability of two-time-scale discrete-time multi-agent systemsConstructing a controllable graph under edge constraintsStrong structural controllability of networksUnified understanding and new results of controllability model of multi‐agent systemsTopological and Graph-Coloring Conditions on the Parameter-Independent Stability of Second-Order Networked SystemsBounding the total forcing number of graphsUnnamed ItemZero forcing in iterated line digraphsZero forcing number, constrained matchings and strong structural controllabilityOptimal regulation of flow networks with transient constraintsStrong structural controllability of colored structured systemsStrong structural input and state observability of linear time-invariant systems: graphical conditions and algorithmsDisturbance decoupling problem for multi-agent systems: a graph topological approachApproximating the minimum rank of a graph via alternating projectionRealization theory for poset-causal systems: controllability, observability and dualityStrong Structural Controllability and Leader Selection for Multi-agent Systems with Unidirectional TopologyStrong structural controllability of networks: comparison of bounds using distances and zero forcingOn extremal graphs for zero forcing number







This page was built for publication: Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs