An upper bound for the minimum rank of a graph

DOI10.1016/j.laa.2008.04.038zbMath1144.05314OpenAlexW1999309847MaRDI QIDQ947626

Shmuel Friedland, Uriel G. Rothblum, Leslie Hogben, Abraham 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

graphrankminimum degreematrixminimum rankmaximum nullitydelta conjecture

Mathematics Subject Classification ID

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

Related Items (25)

The relationship between triangle size and minimum rank for 7 × 7 zero-nonzero patterns ⋮ Proof of a conjecture on the zero forcing number of a graph ⋮ Maximum generic nullity of a graph ⋮ Families of graphs with maximum nullity equal to zero forcing number ⋮ A linear time algorithm for the nullity of vertex-weighted block graphs ⋮ A comparison between the metric dimension and zero forcing number of trees and unicyclic graphs ⋮ Some properties of the closed global shadow graphs and their zero forcing number ⋮ Nonsingular (vertex-weighted) block graphs ⋮ On the minimum rank of the third power of a starlike tree ⋮ Open global shadow graph and it’s zero forcing number ⋮ Unnamed Item ⋮ Matroids and the Minimum Rank Problem for Matrix Patterns ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Bounds on expected propagation time of probabilistic zero forcing ⋮ Parameters Related to Tree‐Width, Zero Forcing, and Maximum Nullity of a Graph ⋮ On minimum rank and zero forcing sets of a graph ⋮ Bounds on minimum semidefinite rank of graphs ⋮ Expected values of parameters associated with the minimum rank of a graph ⋮ Maximum nullity and zero forcing number of graphs with rank at most 4 ⋮ A short proof for a lower bound on the zero forcing number ⋮ Zero forcing sets and bipartite circulants ⋮ Lower bounds in minimum rank problems ⋮ On zero forcing number of graphs and their complements ⋮ On extremal graphs for zero forcing number

Cites Work

• Minimum rank and maximum eigenvalue multiplicity of symmetric tree sign patterns
• The minimum rank of symmetric matrices described by a graph: a survey
• Computation of minimal rank and path cover number for certain graphs
• Zero forcing sets and the minimum rank of graphs
• Graphs whose minimal rank is two

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