Note on a graph-theoretic criterion for structural output controllability

The structural output controllability of a dynamical system is studied. It is known that the maximum size of linking in an associated dynamic graph provides a good upper bound on the dynamic graph and it was believed that the bound is exact. This conjecture is disproved, and a new, efficiently computed lower bound is presented.<
>