Pages that link to "Item:Q3394472"
From MaRDI portal
The following pages link to On the minimum rank of not necessarily symmetric matrices: A preliminary study (Q3394472):
Displayed 22 items.
- 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)
- Zero forcing number, constrained matchings and strong structural controllability (Q491112) (← links)
- Zero forcing propagation time on oriented graphs (Q526815) (← links)
- Minimum rank problems (Q848577) (← links)
- On minimum rank and zero forcing sets of a graph (Q967512) (← 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)
- Zero forcing in iterated line digraphs (Q1727740) (← links)
- A zero forcing technique for bounding sums of eigenvalue multiplicities (Q1979365) (← links)
- On the zero forcing number and propagation time of oriented graphs (Q2131584) (← links)
- Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph (Q2359555) (← links)
- Odd Cycle Zero Forcing Parameters and the Minimum Rank of Graph Blowups (Q2794394) (← links)
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks (Q2850984) (← links)
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph (Q4908829) (← links)
- The relationship between triangle size and minimum rank for <i>7</i> × <i>7</i> zero-nonzero patterns (Q5036729) (← links)
- Matroids and the Minimum Rank Problem for Matrix Patterns (Q5127269) (← links)
- Connected zero forcing sets and connected propagation time of graphs (Q5139339) (← links)
- (Q5855594) (← links)
- A matching-minor monotone parameter for bipartite graphs (Q6087877) (← links)
- (Q6179673) (← links)