The following pages link to Minimum rank problems (Q848577):
Displaying 30 items.
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph (Q417526) (← links)
- A technique for computing the zero forcing number of a graph with a cut-vertex (Q417535) (← links)
- On the minimum rank of the third power of a starlike tree (Q417547) (← links)
- Propagation time for zero forcing on a graph (Q442213) (← links)
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- Zero forcing number, Grundy domination number, and their variants (Q1713312) (← links)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- Optimal regulation of flow networks with transient constraints (Q1737918) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- Rigid linkages and partial zero forcing (Q2001975) (← links)
- Subgraph complementation and minimum rank (Q2121776) (← links)
- On the zero forcing number and propagation time of oriented graphs (Q2131584) (← links)
- Critical ideals, minimum rank and zero forcing number (Q2279368) (← links)
- Extremal \(k\)-forcing sets in oriented graphs (Q2416417) (← links)
- Strong structural controllability of networks (Q2417896) (← links)
- Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups (Q2794394) (← links)
- Failed power domination on graphs (Q5109066) (← links)
- (Q5130665) (← links)
- Connected zero forcing sets and connected propagation time of graphs (Q5139339) (← links)
- Matching, path covers, and total forcing sets (Q5215393) (← links)
- (Q5855594) (← links)
- An integer program for positive semidefinite zero forcing in graphs (Q6092625) (← links)
- The zero forcing number of graphs with the matching number and the cyclomatic number (Q6172214) (← links)
- Uniformly sparse graphs and matrices (Q6543062) (← links)
- Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs (Q6564843) (← links)
- Solving systems of linear equations through zero forcing set (Q6591655) (← links)
- The zero forcing span of a graph (Q6616830) (← links)
