It is shown that the determinant of the variable adjacency matrix, and hence the determinant of the adjacency matrix of a graph, are circuit polynomials. From this, it is deduced that determinants of symmetric matrices are indeed circuit polynomials of associated graphs.
The results are then extended to general matrices