Minimum rank of a graph

The minimum rank of a graph is a concept from algebraic graph theory that is associated with the graph's adjacency matrix or Laplacian matrix. Specifically, it refers to the smallest rank among all real symmetric matrices corresponding to the graph.