An exact algorithm for the minimum rank of a graph

Boris Brimkov, Zachary Scherr

The minimum rank of a graph G is the minimum rank over all real symmetric matrices whose off-diagonal sparsity pattern is the same as that of the adjacency matrix of G. In this not…