3 problems

Wong and Zhu's conjecture. For any graph $G$,

Let $G$ be a graph, and let $A_G$ be the matrix whose rows are indexed by the edges of $G$ and whose columns are indexed by the vertices and edges of $G$, with entries determined b…

Let $G$ be a graph with no isolated edges. Let $B_G$ be the submatrix, associated with the graph polynomial, whose columns are indexed by the edges of $G$. For a matrix $A$, its pe…