2 citations · 2 across the 1 of their papers we have counts for
1 paper · 1 filter
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…