On the minimum rank of not necessarily symmetric matrices: A preliminary study

DOI10.13001/1081-3810.1300MaRDI QIDQ3394472zbMATHOpenAlexFDO

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

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graphrankminimum degreeedit distanceinverse eigenvalue problemsymmetric matrixmaximum nullityminimum rankzero forcing numberzero forcing setdirected treepath cover numbertriangle numberasymmetric minimum rankditreesymmetric minimum rank

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Trees (05C05) Eigenvalues, singular values, and eigenvectors (15A18) Vector spaces, linear dependence, rank, lineability (15A03)

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

(30)

• Solving systems of linear equations through zero forcing set
• Odd cycle zero forcing parameters and the minimum rank of graph blowups
• Zero forcing number, constrained matchings and strong structural controllability
• The minimum rank problem for a linear directed 2-tree
• Diagonal entry restrictions in minimum rank matrices
• Matroids and the minimum rank problem for matrix patterns
• On the minimum rank of the third power of a starlike tree
• The relationship between triangle size and minimum rank for \(7 \times 7\) zero-nonzero patterns
• Zero forcing in iterated line digraphs
• On minimum rank and zero forcing sets of a graph
• Connected zero forcing sets and connected propagation time of graphs
• Sign patterns with minimum rank 2 and upper bounds on minimum ranks
• A matching-minor monotone parameter for bipartite graphs
• A note on universally optimal matrices and field independence of the minimum rank of a graph
• Zero forcing parameters and minimum rank problems
• A zero forcing technique for bounding sums of eigenvalue multiplicities
• 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
• Minimum rank problems
• Maximum nullity, zero forcing number and propagation time of \(\ell\)-path graphs
• 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
• On the zero forcing number of the complement of graphs with forbidden subgraphs
• On the zero forcing number and propagation time of oriented graphs
• Computing the zero forcing number for generalized Petersen graphs
• Zero forcing propagation time on oriented graphs
• Computation of minimal rank and path cover number for certain graphs
• A variant on the graph parameters of Colin de Verdiere: Implications to the minimum rank of graphs
• Path cover number, maximum nullity, and zero forcing number of oriented graphs and other simple digraphs
• Minimum rank, maximum nullity, and zero forcing number of simple digraphs

Describes a project that uses

Uses Software

• SageMath

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)