Pages that link to "Item:Q2983053"

The following pages link to Zero Forcing Sets and Controllability of Dynamical Systems Defined on Graphs (Q2983053):

Displaying 19 items.

• Group controllability of discrete-time multi-agent systems (Q326187) (← links)
• Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
• Leader selection for strong structural controllability of single-integrator multi-agent systems (Q1621105) (← links)
• Constructing a controllable graph under edge constraints (Q1680674) (← links)
• Zero forcing in iterated line digraphs (Q1727740) (← links)
• Optimal regulation of flow networks with transient constraints (Q1737918) (← links)
• Approximating the minimum rank of a graph via alternating projection (Q1785758) (← links)
• Strong structural input and state observability of linear time-invariant systems: graphical conditions and algorithms (Q1996663) (← links)
• Disturbance decoupling problem for multi-agent systems: a graph topological approach (Q2018578) (← links)
• Realization theory for poset-causal systems: controllability, observability and duality (Q2036479) (← links)
• Strong structural controllability of networks: comparison of bounds using distances and zero forcing (Q2097717) (← links)
• On extremal graphs for zero forcing number (Q2102756) (← links)
• Partial strong structural controllability (Q2139435) (← links)
• Group controllability of two-time-scale discrete-time multi-agent systems (Q2181428) (← links)
• Strong structural controllability of colored structured systems (Q2243018) (← links)
• Almost equitable partitions and new necessary conditions for network controllability (Q2407159) (← links)
• Strong structural controllability of networks (Q2417896) (← links)
• Unified understanding and new results of controllability model of multi‐agent systems (Q6082762) (← links)
• Bounding the total forcing number of graphs (Q6181334) (← links)