# Zero forcing sets and controllability of dynamical systems defined on graphs

arXiv: https://arxiv.org/abs/1403.4868 · HTML: https://mlsanity.com/paper/1403.4868/

## Key facts

- Cited by 2 papers in the map (data through 14 Oct 2026).
- First posted on arXiv 19 Mar 2014.

## Built on by (most cited first, 2 of 2)

- [Control-based Graph Embeddings with Data Augmentation for Contrastive Learning](https://mlsanity.com/paper/2403.04923/) (2024)
- [Seven open problems in applied combinatorics](https://mlsanity.com/paper/2303.11464/) (2023)

## Abstract (arXiv)

In this paper, controllability of systems defined on graphs is discussed. We consider the problem of controllability of the network for a family of matrices carrying the structure of an underlying directed graph. A one-to-one correspondence between the set of leaders rendering the network controllable and zero forcing sets is established. To illustrate the proposed results, special cases including path, cycle, and complete graphs are discussed. Moreover, as shown for graphs with a tree structure, the proposed results of the present paper together with the existing results on the zero forcing sets lead to a minimal leader selection scheme in particular cases.