期刊名称：Journal of Theoretical and Applied Information Technology
印刷版ISSN：1992-8645
电子版ISSN：1817-3195
出版年度：2011
卷号：32
期号：1
页码：01-07
出版社：Journal of Theoretical and Applied
摘要：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 paper we give the major recursive formula that counts the number of spanning trees in the general case of grid graph, then we propose some spanning trees recursions for families of planar graphs called crosses maps such as the cross grid and the cross ocotogonal map by using the spanning tree theorem and we give a new algorithm to count the complexity of some particular maps such as the kite map.
