On the minimum rank of not necessarily symmetric matrices: A preliminary study
From MaRDI portal
Publication:3394472
Recommendations
- Minimum rank problems
- The minimum rank problem for a linear directed 2-tree
- Minimum rank, maximum nullity, and zero forcing number of simple digraphs
- Zero forcing sets and the minimum rank of graphs
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
Cited in
(34)- Zero forcing in iterated line digraphs
- Computation of minimal rank and path cover number for certain graphs
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- On the zero forcing number and propagation time of oriented graphs
- Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
- Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph
- Odd cycle zero forcing parameters and the minimum rank of graph blowups
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- A technique for computing the zero forcing number of a graph with a cut-vertex
- On the minimum rank of the third power of a starlike tree
- The minimum rank problem for a linear directed 2-tree
- Parameters related to tree-width, zero forcing, and maximum nullity of a graph
- Zero forcing number, constrained matchings and strong structural controllability
- The relationship between triangle size and minimum rank for 7 7 zero-nonzero patterns
- Matroids and the minimum rank problem for matrix patterns
- Connected zero forcing sets and connected propagation time of graphs
- Zero forcing propagation time on oriented graphs
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- Diagonal entry restrictions in minimum rank matrices
- Minimum rank, maximum nullity, and zero forcing number of simple digraphs
- Computing the zero forcing number for generalized Petersen graphs
- A matching-minor monotone parameter for bipartite graphs
- Maximum nullity, zero forcing number and propagation time of -path graphs
- Solving systems of linear equations through zero forcing set
- On the zero forcing number of the complement of graphs with forbidden subgraphs
- Zero forcing number and propagation time discrepancy of some graphs
- Relationships between minimum rank problem parameters for cobipartite graphs
- Zero forcing number and maximum nullity of general power graphs
- Zero forcing of generalized hierarchical products
- Minimum rank problems
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- A note on universally optimal matrices and field independence of the minimum rank of a graph
This page was built for publication: On the minimum rank of not necessarily symmetric matrices: A preliminary study
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3394472)
