Minimum rank of edge subdivisions of graphs
Minimum rank of edge subdivisions of graphs
Let F be a field, let G be an undirected graph on n vertices, and let S(F, G)be the set of all F-valued symmetric n × n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The minimum rank of G over F …