Jason Smith

most citedProgram for calculating bounds on the minimum rank of a graph using Sage

7 citations · 11 across the 2 of their papers we have counts for

collaborators

Showing math.COShow all

2 papers · 1 filter

math.CO2008★ 7 cited

Program for calculating bounds on the minimum rank of a graph using Sage

Laura DeLoss, Jason Grout, Tracy McKay +2

The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$ th entry (for $i \neq = j$ ) is nonzero whenever ${i, j}$ …

math.CO2008★ 4 cited

Table of minimum ranks of graphs of order at most 7 and selected optimal matrices

Laura DeLoss, Jason Grout, Leslie Hogben +3

The minimum rank of a simple graph $G$ is defined to be the smallest possible rank over all symmetric real matrices whose $ij$ th entry (for $i \neq = j$ ) is nonzero whenever ${i, j}$ …