On the minimum rank of not necessarily symmetric matrices: A preliminary study
DOI10.13001/1081-3810.1300zbMATH Open1169.05345OpenAlexW2169257454MaRDI QIDQ3394472FDOQ3394472
Authors: Francesco Barioli, Shaun M. Fallat, H. Tracy Hall, Daniel Hershkowitz, Hein van der Holst, Leslie Hogben, Bryan L. Shader 
Publication date: 7 September 2009
Published in: The Electronic Journal of Linear Algebra (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/130472
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
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
graphrankminimum degreeedit distanceinverse eigenvalue problemsymmetric matrixmaximum nullityminimum rankzero forcing numberzero forcing setdirected treepath cover numbertriangle numberasymmetric minimum rankditreesymmetric minimum rank
Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)
Cited In (26)
- Zero forcing in iterated line digraphs
- On the zero forcing number and propagation time of oriented graphs
- On the minimum rank of the third power of a starlike tree
- A note on universally optimal matrices and field independence of the minimum rank of a graph
- Solving systems of linear equations through zero forcing set
- Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph
- Existence of a not necessarily symmetric matrix with given distinct eigenvalues and graph
- Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
- A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
- A technique for computing the zero forcing number of a graph with a cut-vertex
- Zero forcing number, constrained matchings and strong structural controllability
- Minimum rank problems
- On minimum rank and zero forcing sets of a graph
- Zero forcing parameters and minimum rank problems
- On the zero forcing number of the complement of graphs with forbidden subgraphs
- Computation of minimal rank and path cover number for certain graphs
- The relationship between triangle size and minimum rank for 7 × 7 zero-nonzero patterns
- A matching-minor monotone parameter for bipartite graphs
- Connected zero forcing sets and connected propagation time of graphs
- Title not available (Why is that?)
- Matroids and the Minimum Rank Problem for Matrix Patterns
- Title not available (Why is that?)
- Odd cycle zero forcing parameters and the minimum rank of graph blowups
- Sign patterns with minimum rank 2 and upper bounds on minimum ranks
- A zero forcing technique for bounding sums of eigenvalue multiplicities
- Zero forcing propagation time on oriented graphs
Uses Software
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)
