Pages that link to "Item:Q975607"
From MaRDI portal
The following pages link to Zero forcing parameters and minimum rank problems (Q975607):
Displaying 26 items.
- Grundy domination and zero forcing in Kneser graphs (Q5217081) (← links)
- Strong Structural Controllability and Leader Selection for Multi-agent Systems with Unidirectional Topology (Q5223267) (← links)
- On zero forcing number of graphs and their complements (Q5245854) (← links)
- Minimum rank with zero diagonal (Q5501682) (← links)
- Finding Low-rank Solutions of Sparse Linear Matrix Inequalities using Convex Optimization (Q5737726) (← links)
- Zero forcing number, maximum nullity, and path cover number of subdivided graphs (Q5746857) (← links)
- (Q5855594) (← links)
- Graph complement conjecture for classes of shadow graphs (Q5862842) (← links)
- Fuzzification of Zero Forcing Process (Q5874624) (← links)
- On the complexity of the positive semidefinite zero forcing number (Q5962481) (← links)
- The minimum rank problem for circulants (Q5962494) (← links)
- An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)
- Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters (Q6166671) (← links)
- Open global shadow graph and it’s zero forcing number (Q6168623) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- Sparks of symmetric matrices and their graphs (Q6202068) (← links)
- Zero forcing with random sets (Q6204353) (← links)
- Chordal graphs and distinguishability of quantum product states (Q6541336) (← links)
- Uniformly sparse graphs and matrices (Q6543062) (← links)
- Cup stacking in graphs (Q6553185) (← links)
- Failed zero forcing numbers of Kneser graphs, Johnson graphs, and hypercubes (Q6584800) (← links)
- Bounds on zero forcing using (upper) total domination and minimum degree (Q6601135) (← links)
- Spectral arbitrariness for trees fails spectacularly (Q6615753) (← links)
- The zero forcing number of claw-free cubic graphs (Q6633547) (← links)
- On the zero forcing number of the complement of graphs with forbidden subgraphs (Q6635254) (← links)
- Well-forced graphs (Q6650723) (← links)
