Local Convergence of Graphs and Enumeration of Spanning Trees
نویسنده
چکیده
A spanning tree in a connected graph G is a subgraph that contains every vertex of G and is itself a tree. Clearly, if G is a tree then it has only one spanning tree. Every connected graph contains at least one spanning tree: iteratively remove an edge from any cycle that is present until the graph contains no cycles. Counting spanning trees is a very natural problem. Following Lyons [5] we will see how the theory of graph limits does this in an asymptotic sense. There are many other interesting questions that involve understanding spanning trees in large graphs, for example, what is a ‘random spanning tree’ of Z? We will not discuss these questions in this note, however, the interested reader should see chapters 4, 10 and 11 of Lyons and Peres [7]. Let us begin with some motivating examples. Let Pn denote the path on n vertices. Each Pn naturally embeds into the bi-infinite path whose vertices are the set of integers Z with edges between consecutive integers. By an abuse of notation we denote the bi-infiite path as Z. It is intuitive to say that Pn converges to Z as these paths can be embedded into Z in a nested manner such that they exhaust Z. Clearly, both Pn and Z contain only one spanning tree. So the number of spanning trees in Pn converges to the number of spanning trees in Z. Is this part of some general phenomenon?
منابع مشابه
Counting the number of spanning trees of graphs
A spanning tree of graph G is a spanning subgraph of G that is a tree. In this paper, we focus our attention on (n,m) graphs, where m = n, n + 1, n + 2, n+3 and n + 4. We also determine some coefficients of the Laplacian characteristic polynomial of fullerene graphs.
متن کاملNUMBER OF SPANNING TREES FOR DIFFERENT PRODUCT GRAPHS
In this paper simple formulae are derived for calculating the number of spanning trees of different product graphs. The products considered in here consists of Cartesian, strong Cartesian, direct, Lexicographic and double graph. For this purpose, the Laplacian matrices of these product graphs are used. Form some of these products simple formulae are derived and whenever direct formulation was n...
متن کاملMissing The Forest to Count the Trees: Spanning Tree Enumeration in Complete and Non-Complete Graphs
Spanning trees have been studied extensively and have many practical applications. From astronomers using spanning trees to find quasar superstructures, to biomedical engineers detecting actin fibers in cell images tree enumeration remains an interesting problem. In this paper we examine a simple, practical, algebraic approach for the enumeration of spanning trees in complete and non-complete g...
متن کاملEnumerating spanning trees of graphs with an involution
As the extension of the previous work by Ciucu and the present authors (J. Combin. Theory Ser. A 112(2005) 105–116), this paper considers the problem of enumeration of spanning trees of weighted graphs with an involution which allows fixed points. We show that if G is a weighted graph with an involution, then the sum of weights of spanning trees of G can be expressed in terms of the product of ...
متن کاملEnumeration of spanning trees of certain graphs
In this note we give an algorithm which enables us to encode and enumerate all the spanning trees of a multipartite graph (see below). This algorithm may turn out to be useful for the enumeration of spanning trees satisfying certain conditions. The number of spanning trees of a given graph Γ without loops and without multiple edges will be denoted by_i(T). We shall consider the graphs Γ = T(G; ...
متن کامل