It is known that Kirchhoff Matrix Theorem computes the number of spanning trees in any graph G by taking a determinant; so far, many works derived a recursive function to calculate the complexity of certain families of maps specially Grid map. In this pap
展开▼
