1 paper
Craig Erickson, Luyining Gan, Jürgen Kritschgau +2
Given a graph G with vertices {v1,…,vn}, we define S(G) to be the set of symmetric matrices A=[ai,j] such that for i=j we have ai,j=0 if…