Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
From MaRDI portal
Publication:5353339
DOI10.1109/TAC.2013.2250075zbMath1369.93079arXiv1111.1475OpenAlexW1996839950WikidataQ59473239 ScholiaQ59473239MaRDI QIDQ5353339
No author found.
Publication date: 8 September 2017
Published in: IEEE Transactions on Automatic Control (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1111.1475
Related Items (21)
On the zero forcing number and spectral radius of graphs ⋮ On the zero forcing number and propagation time of oriented graphs ⋮ Fractional zero forcing via three-color forcing games ⋮ Failed skew zero forcing on a graph ⋮ k-Forcing number for Cartesian product of some graphs ⋮ Proper colorings from positive semidefinite zero forcing sets ⋮ Controllability of NEPSes of graphs ⋮ Constructing a controllable graph under edge constraints ⋮ On the universality of the quantum approximate optimization algorithm ⋮ Failed zero forcing and critical sets on directed graphs ⋮ Unnamed Item ⋮ Graphs of unitary matrices and positive semidefinite zero forcing ⋮ Probabilistic zero forcing on random graphs ⋮ The zero forcing polynomial of a graph ⋮ Zero forcing number, constrained matchings and strong structural controllability ⋮ On leaky forcing and resilience ⋮ Zero forcing propagation time on oriented graphs ⋮ Logic circuits from zero forcing ⋮ On the relationships between zero forcing numbers and certain graph coverings ⋮ Approximating the minimum rank of a graph via alternating projection ⋮ Tight bounds on probabilistic zero forcing on hypercubes and grids
This page was built for publication: Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks
