Related papers: Spanning Trees on Hypercubic Lattices and Non-orie…
We prove infinitely many cases of conjectured sharp upper and lower bounds for the spanning tree entropy of any planar lattice graph. These bounds come from volumes of associated hyperbolic alternating links, right-angled hyperbolic…
String theory in 4 dimensions has the unique feature that a topological term, the oriented self-intersection number, can be added to the usual action. It has been suggested that the corresponding theory of random surfaces wold be free from…
In this paper, we introduce two families of planar and self-similar graphs which have small-world properties. The constructed models are based on an iterative process where each step of a certain formulation of modules results in a final…
In this paper algebraic and combinatorial properties and a computation of the number of the spanning trees are developed for certain graphs. To this purpose, an original method, independent of the spectrum of the Laplacian matrix associated…
Spanning trees are an important quantity characterizing the reliability of a network, however, explicitly determining the number of spanning trees in networks is a theoretical challenge. In this paper, we study the number of spanning trees…
We classify connected spanning convex subgraphs of the square cycles. We then show that every spanning tree of $C_n^2$ is contained in a unique nontrivial connected spanning convex subgraph of $C_n^2$. As a result, we obtain a purely…
If $G$ is a strongly connected finite directed graph, the set $\mathcal{T}G$ of rooted directed spanning trees of $G$ is naturally equipped with a structure of directed graph: there is a directed edge from any spanning tree to any other…
In this article we investigate the Uniform Spanning Forest ($\mathsf{USF}$) in the nearest-neighbour integer lattice $\mathbf{Z}^{d+1} = \mathbf{Z}\times \mathbf{Z}^d$ with an assignment of conductances that makes the underlying (Network)…
Let $G_1$ and $G_2$ be simple graphs and let $n_1 = |V(G_1)|$, $m_1 = |E(G_1)|$, $n_2 = |V(G_2)|$ and $m_2 = |E(G_2)|.$ In this paper we derive sharp upper and lower bounds for the number of spanning trees $\tau$ in the Cartesian product…
The problem of spanning trees is closely related to various interesting problems in the area of statistical physics, but determining the number of spanning trees in general networks is computationally intractable. In this paper, we perform…
In magnetostatics and eddy current problems, formulated in terms of the magnetic vector potential, the solution is not unique, because the addition of an irrotational function to the solution remains a valid solution. The tree-cotree…
We study spin systems on Bethe lattices constructed from d-dimensional hypercubes. Although these lattices are not tree-like, and therefore closer to real cubic lattices than Bethe lattices or regular random graphs, one can still use the…
The relative importance of the intrinsic and extrinsic factors determining the variety of geometric shapes exhibited by dendritic trees remains unclear. This question was addressed by developing a model of the growth of dendritic trees…
Using the matrix-forest theorem and the Parisi-Sourlas trick we formulate and solve a one-matrix model with non-polynomial potential which provides perturbation theory for massive spinless fermions on dynamical planar graphs. This is a…
Certain families of combinatorial objects admit recursive descriptions in terms of generating trees: each node of the tree corresponds to an object, and the branch leading to the node encodes the choices made in the construction of the…
In this paper we find the generating function for the number of vertices which have $k$ elements in their subtree and use this generating function to calculate the probability that a vertex has a size $k$ subtree. We also show how this same…
In this paper, we develop a new method to produce explicit formulas for the number $\tau(n)$ of spanning trees in the undirected circulant graphs $C_{n}(s_1,s_2,\ldots,s_k)$ and $C_{2n}(s_1,s_2,\ldots,s_k,n).$ Also, we prove that in both…
We generalize the uniform spanning tree to construct a family of determinantal measures on essential spanning forests on periodic planar graphs in which every component tree is bi-infinite. Like the uniform spanning tree, these measures…
An important problem in statistical physics concerns the fascinating connections between partition functions of lattice models studied in equilibrium statistical mechanics on the one hand and graph theoretical enumeration problems on the…
The {\sc Directed Maximum Leaf Out-Branching} problem is to find an out-branching (i.e. a rooted oriented spanning tree) in a given digraph with the maximum number of leaves. In this paper, we obtain two combinatorial results on the number…