Minimum rank problems

DOI10.1016/J.LAA.2009.05.003MaRDI QIDQ848577zbMATH OpenOpenAlexFDO

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

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)

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

Cites work

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

Cited in

(45)

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

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)