The Laplacian Permanent and Ratio of Small Vertex Trees

对于一个图G，若其连通且无圈，我们就称G是一棵树，记为T。本文计算小顶点树的拉普拉斯矩阵积和式以及拉普拉斯比率，并且得到一些限定参数的大小的结果。For a graph G, if it is connected and acyclic, we call G a tree, denoted as T. In this paper, the permanents of the Laplacian matrices and the Laplacian ratios of small-vertex trees are calculated, and some results on limiting the magnitudes of certain parameters are obtained.