搜索结果: 1-8 共查到“理学 SPANNING TREES”相关记录8条 . 查询时间(0.093 秒)
The absence of efficient dual pairs of spanning trees in planar graphs
planar graphs cells
2015/8/26
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T* in the dual graph G* such that T and T* do not intersect. We show that it is not always possible to find T in ...
SANDPILE GROUPS AND SPANNING TREES OF DIRECTED LINE GRAPHS
SANDPILE GROUPS SPANNING TREES DIRECTED LINE GRAPHS
2015/8/14
We generalize a theorem of Knuth relating the oriented spanning trees of a directed graph G and its directed line graph LG. The sandpile group is an abelian group associated to a directed graph, whose...
Spanning trees of graphs on surfaces and the intensity of loop-erased random walk on Z^2
Uniform spanning tree loop-erased random walk abelian sandpile model
2011/9/14
Abstract: We show how to compute the probabilities of various connection topologies for uniformly random spanning trees on graphs embedded in surfaces. As an application, we show how to compute the "i...
Spanning trees and expansions for the Potts model partition function in an external field
Tutte polynomial Potts model spanning trees V -polynomial external field Hamiltonian edge activities
2011/9/5
Abstract: We use a deletion-contraction relation for the variable field Potts model partition function to give an expansion of the variable field Potts model partition function in terms of the zero fi...
Chip-firing games, potential theory on graphs, and spanning trees
Chip-firing games graphs spanning trees Combinatorics
2011/8/26
Abstract: We study the interplay between chip-firing games and potential theory on graphs, characterizing reduced divisors ($G$-parking functions) on graphs as the solution to an energy (or potential)...
In this paper, we find recursive relations t(Ln) = 4t(Ln−1)−t(Ln−2), t(Fn) = 3t(Fn−1) − t(Fn−2), and t(Wn) = t(Wn−1) + t(Fn) + t(Fn−1), for determining ...
Formulas for the number of spanning trees in a fan
Graph theory spanning trees enumeration
2010/9/10
Let Pn be a simple path on n vertices. An n-fan is a simple graph G formed from a path Pn by adding a vertex adjacent to every vertex of Pn. In this work we denote n-fan by Fn+1 and derive the explici...
Spanning Trees on Hypercubic Lattices and Non-orientable Surfaces
Trees Hypercubic Lattices Non-orientable Surfaces
2010/11/2
We consider the problem of enumerating spanning trees on lattices. Closed-form expressions are obtained for the spanning tree generating function for a hypercubic lattice of size N_1 x N_2 x...x N_d ...