T. McKay

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

7 citations · 12 across the 4 of their papers we have counts for

collaborators

4 papers

math.CO2010

On the edit distance from $K_{2, t}$ -free graphs II: Cases $t \geq 5$

Ryan Martin, Tracy McKay

The edit distance between two graphs on the same vertex set is defined to be size of the symmetric difference of their edge sets. The edit distance function of a hereditary propert…

math.CO2010★ 1 cited

On the edit distance from $K_{2, t}$ -free graphs (Extended Version)

Ryan R. Martin, Tracy McKay

The edit distance between two graphs on the same vertex set is defined to be the size of the symmetric difference of their edge sets. The edit distance function of a hereditary pro…

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}$ …

On the edit distance from K2,t​-free graphs II: Cases t≥5

On the edit distance from K2,t​-free graphs (Extended Version)

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

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

On the edit distance from $K_{2, t}$ -free graphs II: Cases $t \geq 5$

On the edit distance from $K_{2, t}$ -free graphs (Extended Version)