Descriptive complexity of controllable graphs

Aida Abiad, Anuj Dawar, Octavio Zapata

Let $G$ be a graph on $n$ vertices with adjacency matrix $A$, and let $1$ be the all-ones vector. We call $G$ controllable if the set of vectors $\mathbf{1}, A\mathbf{1},…