The minimum rank problem over finite fields

Jason Grout

The structure of all graphs having minimum rank at most k over a finite field with q elements is characterized for any possible k and q. A strong connection between this characteri…