Minimum rank problems

DOI10.1016/J.LAA.2009.05.003zbMATH Open1213.05036OpenAlexW2093817461MaRDI QIDQ848577FDOQ848577

Authors: Leslie Hogben 

Publication date: 4 March 2010

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.laa.2009.05.003

Recommendations

• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• The minimum rank of symmetric matrices described by a graph: a survey
• The minimum rank problem for a linear directed 2-tree
• Zero forcing sets and the minimum rank of graphs
• Minimum rank of powers of trees

zbMATH Keywords

graphtreerankmatrixpath coversymmetric matrixmaximum nullityminimum rankzero forcing numberzero forcing setdirected treepath cover 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)

Cites Work

• Zero forcing sets and the minimum rank of graphs
• The combinatorial structure of generalized eigenspaces -- from nonnegative matrices to general matrices
• Computation of minimal rank and path cover number for certain graphs
• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• Techniques for determining the minimum rank of a small graph
• The minimum rank of symmetric matrices described by a graph: a survey
• The maximum multiplicity of an eigenvalue in a matrix whose graph is a tree
• Graphs whose minimal rank is two
• Minimum-rank matrices with prescribed graph
• On the minimum rank of not necessarily symmetric matrices: A preliminary study

Cited In (45)

• Zero forcing in iterated line digraphs
• Strong structural controllability of networks
• Loop zero forcing and Grundy domination in planar graphs and claw-free cubic graphs
• On the zero forcing number and propagation time of oriented graphs
• The minimum rank problem over the finite field of order 2: Minimum rank 3
• The minimum rank problem over finite fields
• Optimal regulation of flow networks with transient constraints
• Failed power domination on graphs
• Matroids and the minimum rank problem for matrix patterns
• On the minimum rank of the third power of a starlike tree
• Extremal \(k\)-forcing sets in oriented graphs
• The zero forcing number of graphs with the matching number and the cyclomatic number
• Minimum rank, maximum nullity, and zero forcing number of simple digraphs
• Solving systems of linear equations through zero forcing set
• The range co-minima problem
• Computing the zero forcing number for generalized Petersen graphs
• The minimum rank problem for circulants
• The minimum rank problem for a linear directed 2-tree
• Using a new zero forcing process to guarantee the strong Arnold property
• Vertex and edge spread of zero forcing number, maximum nullity, and minimum rank of a graph
• The zero forcing span of a graph
• A technique for computing the zero forcing number of a graph with a cut-vertex
• Propagation time for zero forcing on a graph
• Minimum rank with zero diagonal
• Zero forcing number, constrained matchings and strong structural controllability
• On minimum rank and zero forcing sets of a graph
• Subgraph complementation and minimum rank
• Minimum rank of generalized star and complete bipartite graph with loops
• The inverse eigenvalue and inertia problems for minimum rank two graphs
• Minimum rank of powers of trees
• The minimum rank of symmetric matrices described by a graph: a survey
• Connected zero forcing sets and connected propagation time of graphs
• Critical ideals, minimum rank and zero forcing number
• Minimum rank of graphs with loops
• On the zero forcing number of graphs and their splitting graphs
• On the minimum rank of not necessarily symmetric matrices: A preliminary study
• Zero forcing number, Grundy domination number, and their variants
• Uniformly sparse graphs and matrices
• Almost full rank matrices arising from transitive tournaments
• Matching, path covers, and total forcing sets
• Odd cycle zero forcing parameters and the minimum rank of graph blowups
• A zero forcing technique for bounding sums of eigenvalue multiplicities
• Rigid linkages and partial zero forcing
• An integer program for positive semidefinite zero forcing in graphs
• Zero forcing propagation time on oriented graphs

This page was built for publication: Minimum rank problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q848577)