Pages that link to "Item:Q2477541"
From MaRDI portal
The following pages link to Zero forcing sets and the minimum rank of graphs (Q2477541):
Displayed 19 items.
- Minimum rank of outerplanar graphs (Q417506) (← links)
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph (Q417526) (← links)
- On the graph complement conjecture for minimum rank (Q417528) (← 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)
- The minimum rank of universal adjacency matrices (Q448355) (← links)
- The minimum semidefinite rank of the complement of partial \(k\)-trees (Q627949) (← links)
- Lower bounds for minimum semidefinite rank from orthogonal removal and chordal supergraphs (Q649553) (← links)
- Zero forcing sets and bipartite circulants (Q763073) (← links)
- Minimum rank problems (Q848577) (← links)
- Orthogonal representations, minimum rank, and graph complements (Q924328) (← links)
- An upper bound for the minimum rank of a graph (Q947626) (← links)
- Minimum rank of skew-symmetric matrices described by a graph (Q962078) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← links)
- Techniques for determining the minimum rank of a small graph (Q967515) (← links)
- Zero forcing parameters and minimum rank problems (Q975607) (← links)
- A note on universally optimal matrices and field independence of the minimum rank of a graph (Q977476) (← links)
- Lower bounds in minimum rank problems (Q1044621) (← links)