Pages that link to "Item:Q5353339"
From MaRDI portal
The following pages link to Zero Forcing, Linear and Quantum Controllability for Systems Evolving on Networks (Q5353339):
Displayed 21 items.
- Fractional zero forcing via three-color forcing games (Q313806) (← links)
- Failed skew zero forcing on a graph (Q314747) (← links)
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- Constructing a controllable graph under edge constraints (Q1680674) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- Approximating the minimum rank of a graph via alternating projection (Q1785758) (← links)
- Logic circuits from zero forcing (Q2003480) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- Tight bounds on probabilistic zero forcing on hypercubes and grids (Q2073291) (← links)
- On the zero forcing number and spectral radius of graphs (Q2121770) (← links)
- On the zero forcing number and propagation time of oriented graphs (Q2131584) (← links)
- Probabilistic zero forcing on random graphs (Q2225411) (← links)
- On leaky forcing and resilience (Q2243134) (← links)
- Graphs of unitary matrices and positive semidefinite zero forcing (Q2447097) (← links)
- On the universality of the quantum approximate optimization algorithm (Q2681661) (← links)
- k-Forcing number for Cartesian product of some graphs (Q4986275) (← links)
- Failed zero forcing and critical sets on directed graphs (Q5026986) (← links)
- Proper colorings from positive semidefinite zero forcing sets (Q5069779) (← links)
- Controllability of NEPSes of graphs (Q5084721) (← links)
- (Q6119465) (← links)