The paper introduces positive and negative signed zero forcing sets and shows that, when the sign pattern admits only real eigenvalues, a signed network is strongly structurally controllable if the control nodes form a signed, positive signed, and negative signed zero forcing set.
On strong structural controllability of networked systems, a constrained matching approach,
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Strong Structural Controllability of Signed Networks
The paper introduces positive and negative signed zero forcing sets and shows that, when the sign pattern admits only real eigenvalues, a signed network is strongly structurally controllable if the control nodes form a signed, positive signed, and negative signed zero forcing set.