Calculation of the number of minimum spanning trees of a graph can be done by applying this function
Calculation of the number of minimum spanning trees of a graph can be done by applying this function to the reduced Laplacian according to Kirchhoff's Theorem. The characteristic polynomial can be found by performing this operation on a difference, one of whose terms has an eigenvalue. Solutions to a system of linear equations can be expressed as a quotient involving this function according to Cramer's rule. This function is the unique, multilinear alternating form on square matrices. In a triangular matrix, the product of all diagonal entries yields this value. For 10 points, name this matrix operation computed using cofactor expansion, and for a 2 by 2 matrix is A D minus B C.
Calculation of the number of minimum spanning trees of a graph can be done by applying this function to the reduced Laplacian according to Kirchhoff's Theorem.
determinants