Pages that link to "Item:Q975607"
From MaRDI portal
The following pages link to Zero forcing parameters and minimum rank problems (Q975607):
Displaying 50 items.
- Using a new zero forcing process to guarantee the strong Arnold property (Q306447) (← links)
- Fractional zero forcing via three-color forcing games (Q313806) (← links)
- Proof of a conjecture on the zero forcing number of a graph (Q313827) (← links)
- Failed skew zero forcing on a graph (Q314747) (← links)
- Induced trees, minimum semidefinite rank, and zero forcing (Q365914) (← links)
- Bounds for minimum semidefinite rank from superpositions and cutsets (Q389675) (← 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)
- Propagation time for zero forcing on a graph (Q442213) (← links)
- Zero forcing number, path cover number, and maximum nullity of cacti (Q444558) (← links)
- Lower bounds for positive semidefinite zero forcing and their applications (Q512866) (← links)
- On the graph complement conjecture for minimum semidefinite rank (Q551287) (← links)
- Minimum rank, maximum nullity and zero forcing number for selected graph families (Q618709) (← links)
- The minimum semidefinite rank of a triangle-free graph (Q630548) (← links)
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs (Q649553) (← links)
- Throttling for the game of cops and robbers on graphs (Q724850) (← links)
- On the complexity of failed zero forcing (Q729899) (← links)
- Zero forcing sets and bipartite circulants (Q763073) (← links)
- Maximum nullity and zero forcing number on graphs with maximum degree at most three (Q777379) (← links)
- On the relationship between the zero forcing number and path cover number for some graphs (Q779727) (← links)
- Positive semidefinite propagation time (Q897615) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- Lower bounds in minimum rank problems (Q1044621) (← links)
- Leader selection for strong structural controllability of single-integrator multi-agent systems (Q1621105) (← links)
- Computational approaches for zero forcing and related problems (Q1631510) (← links)
- Families of graphs with maximum nullity equal to zero forcing number (Q1642895) (← links)
- Constructing a controllable graph under edge constraints (Q1680674) (← links)
- Infection in hypergraphs (Q1701092) (← links)
- Zero forcing number, Grundy domination number, and their variants (Q1713312) (← links)
- Throttling positive semidefinite zero forcing propagation time on graphs (Q1720308) (← links)
- The zero forcing polynomial of a graph (Q1732095) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- Brushing number and zero-forcing number of graphs and their line graphs (Q1756097) (← links)
- Approximating the minimum rank of a graph via alternating projection (Q1785758) (← links)
- Effects of vertex degrees on the zero-forcing number and propagation time of a graph (Q1801062) (← links)
- A lower bound on the zero forcing number (Q1801082) (← links)
- A new lower bound for the positive semidefinite minimum rank of a graph (Q1931723) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- Bounds on expected propagation time of probabilistic zero forcing (Q1979443) (← links)
- The inverse eigenvalue problem of a graph: multiplicities and minors (Q1985452) (← links)
- Rigid linkages and partial zero forcing (Q2001975) (← links)
- Complexity and computation of connected zero forcing (Q2012050) (← links)
- On the relationships between zero forcing numbers and certain graph coverings (Q2017194) (← links)
- Note on forcing problem of trees (Q2062888) (← 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)
- Upper bounds for positive semidefinite propagation time (Q2144516) (← links)
- On the length of L-Grundy sequences (Q2172087) (← links)
- Vector representations of graphs and distinguishing quantum product states with one-way LOCC (Q2185850) (← links)
- Propagation tree decompositions and linearly independent vertices (Q2215974) (← links)
