An upper bound for the minimum rank of a graph

DOI10.1016/J.LAA.2008.04.038MaRDI QIDQ947626zbMATH OpenOpenAlexFDO

Authors S. Friedland, Leslie Hogben, Uriel G. Rothblum, A. Berman, Bryan L. Shader

Publication date 6 October 2008

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

Full work available at URL https://lib.dr.iastate.edu/cgi/viewcontent.cgi?article=1076&context=math_pubs

zbMATH Keywords

graphrankmatrixminimum degreemaximum nullityminimum rankdelta conjecture

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Vector spaces, linear dependence, rank, lineability (15A03)

Recommendations

• Zero forcing sets and the minimum rank of graphs
• The minimum rank of symmetric matrices described by a graph: a survey
• Lower bounds in minimum rank problems
• Minimum rank of a graph over an arbitrary field
• Minimum-rank and maximum-nullity of graphs and their linear preservers

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
• The minimum rank of symmetric matrices described by a graph: a survey
• Zero forcing sets and the minimum rank of graphs

Cited in

(45)

• Maximum nullity and zero forcing number of graphs with rank at most 4
• Expected values of parameters associated with the minimum rank of a graph
• Universally optimal matrices and field independence of the minimum rank of a graph
• A linear time algorithm for the nullity of vertex-weighted block graphs
• Lower bounds in minimum rank problems
• A short proof for a lower bound on the zero forcing number
• Minimum rank of edge subdivisions of graphs
• scientific article; zbMATH DE number 7692355 (Why is no real title available?)
• On the minimum rank of a graph over finite fields
• On order and rank of graphs
• Matroids and the minimum rank problem for matrix patterns
• On the graph complement conjecture for minimum rank
• On the minimum rank of the third power of a starlike tree
• Some Cayley graphs with propagation time of at most two
• The relationship between triangle size and minimum rank for \(7 \times 7\) zero-nonzero patterns
• Unitary matrix digraphs and minimum semidefinite rank
• On minimum rank and zero forcing sets of a graph
• Techniques for determining the minimum rank of a small graph
• Minimum-rank and maximum-nullity of graphs and their linear preservers
• Bounds on expected propagation time of probabilistic zero forcing
• scientific article; zbMATH DE number 3221981 (Why is no real title available?)
• A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs
• On the possible ranks among matrices with a given pattern
• Determining the minimum rank of matroids whose basis graph is common
• On the rank spread of graphs
• Maximum nullity, zero forcing number and propagation time of \(\ell\)-path graphs
• On zero forcing number of graphs and their complements
• Minimum rank of a graph over an arbitrary field
• Nonsingular (vertex-weighted) block graphs
• Some Cayley graphs with propagation time 1
• On the minimum vector rank of multigraphs
• Parameters related to tree-width, zero forcing, and maximum nullity of a graph
• Proof of a conjecture on the zero forcing number of a graph
• Maximum generic nullity of a graph
• Bounds on minimum semidefinite rank of graphs
• Open global shadow graph and it’s zero forcing number
• On the minimum semidefinite rank of a simple graph
• The minimum rank problem for circulants
• Some properties of the closed global shadow graphs and their zero forcing number
• On the minimum hybrid rank of a graph relative to a partition of its edges and its application to electrical network analysis
• On extremal graphs for zero forcing number
• The minimum rank of universal adjacency matrices
• Graphs with real algebraic co-rank at most two
• Families of graphs with maximum nullity equal to zero forcing number
• Zero forcing sets and bipartite circulants

This page was built for publication: An upper bound for the minimum rank of a graph

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