图生成树的计数问题首先由物理学家基尔霍夫在分析电网络时发现，与统计物理中的q-状态Potts模型及网络的可靠性设计密切相关，是代数图论中研究的最基本问题之一。图的临界群不但与算术几何、代数几何有关，也与统计物理中的沙堆模型以及代数图论中的Chip-Firing Games有紧密联系。由于临界群的阶等于图的生成树数目，它的不变因子是图生成树数目的一个加细, 因此可以看做图的一个精细同构不变量，与图的生成树的计数问题密切相关。本项目主要研究以下问题：(1) 嵌入在曲面上的图及其对偶图的生成树的计数问题，重点为统计物理背景下嵌入在环面上的格子图及其对偶图的生成树数目之间的关系。(2) 一般图及其各种变换图的生成树数目之间的关系，特别是非正则图及其线图的生成树数目之间的内在关系。(3) 图的临界群理论，探讨图的其它结构参数和临界群之间的关系。(4) 以上三个问题之间的内在联系及其应用。

The problem on enumeration of spanning trees of graphs was first found by the physicist Kirchhoff during considering electronic networks. This problem is closely related to the q-state Potts model and reliable networks design. It is also one of the most elementary problems in algebraic graph theory. The critical group of graphs is closely related to either arithmetical geometry and algebraic geometry or the sandpile model in statistical physics and Chip-Firing Games in algebraic graph theory. Since the order of the critical group of a graph equals its number of spanning trees, its invariant factor is the refinement of the number of spanning trees. Hence it can be regarded as an isomorphic invariant and is closely related to the problem on enumeration of spanning trees. This project will investigate the following problems: (1). The problem on enumeration of spanning trees of graphs embedded on surfaces, particularly, the relations between the numbers of spanning trees of lattices and their dual lattices on the torus in the context of statistical physics. (2). Relations between the numbers of spanning trees of a general graph and its various transformation graphs, particularly, between the numbers of spanning trees of an irregular graph and its line graph. (3). The theory on the critical group of graphs, especially, the relation between other structure parameters of a graph and its critical group. (4). Relations among above three problems and applications.