3 citations · 3 across the 2 of their papers we have counts for
Showing math.COShow all
3 papers · 1 filter
math.CO2008
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…
math.CO2007★ 3 cited
Graphs with extremal energy should have a small number of distinct eigenvalues
Dragos Cvetkovic, Jason Grout
The sum of the absolute values of the eigenvalues of a graph is called the energy of the graph. We study the problem of finding graphs with extremal energy within specified classes…
math.CO2006
The minimum rank problem over the finite field of order 2: minimum rank 3
Wayne Barrett, Jason Grout, Raphael Loewy
Our main result is a sharp bound for the number of vertices in a minimal forbidden subgraph for the graphs having minimum rank at most 3 over the finite field of order 2. We also l…