Related papers: Counting spanning trees on fractal graphs and thei…

Kirchhoff's Matrix-Tree Theorem asserts that the number of spanning trees in a finite graph can be computed from the determinant of any of its reduced Laplacian matrices. In many cases, even for well-studied families of graphs, this can be…

A spanning tree $T$ in a graph $G$ is a sub-graph of $G$ with the same vertex set as $G$ which is a tree. In 1981, McKay proved an asymptotic result regarding the number of spanning trees in random $k$-regular graphs. In this paper we prove…

We study derivations and Fredholm modules on metric spaces with a local regular conservative Dirichlet form. In particular, on finitely ramified fractals, we show that there is a non-trivial Fredholm module if and only if the fractal is not…

Noncommutative geometry provides a framework, via the construction of spectral triples, for the study of the geometry of certain classes of fractals. Many fractals are constructed as natural limits of certain sets with a simpler structure:…

We construct spectral triples and, in particular, Dirac operators, for the algebra of continuous functions on certain compact metric spaces. The triples are countable sums of triples where each summand is based on a curve in the space.…

Spanning trees are relevant to various aspects of networks. Generally, the number of spanning trees in a network can be obtained by computing a related determinant of the Laplacian matrix of the network. However, for a large generic…

We introduce a decomposition method for the distributed calculation of exact Euclidean Minimum Spanning Trees in high dimensions (where sub-quadratic algorithms are not effective), or more generalized geometric-minimum spanning trees of…

Monotone trees - trees with a function defined on their vertices that decreases the further away from a root node one travels, are a natural model for a process that weakens the further one gets from its source. Given an aggregation of…

This paper focuses on finding a spanning tree of a graph to maximize the number of its internal vertices. We present an approximation algorithm for this problem which can achieve a performance ratio $\frac{4}{3}$ on undirected simple…

We introduce a framework for constructing fractal trees via analytic generator fields, replacing discrete affine transformations and symbolic rewriting rules by the integration of smooth vector fields in an internal state space. In this…

We prove the following sharp estimate for the number of spanning trees of a graph in terms of its vertex-degrees: a simple graph $G$ on $n$ vertices has at most $(1/n^{2}) \prod_{v \in V(G)} (d(v)+1)$ spanning trees. This result is tight…

In this paper we give an exact analytical expression for the number of spanning trees of an infinite family of outerplanar, small-world and self-similar graphs. This number is an important graph invariant related to different topological…

For a two-dimensional lattice $\Lambda$ with $n$ vertices, the number of spanning trees $N_{ST}(\Lambda)$ grows asymptotically as $\exp(n z_\Lambda)$ in the thermodynamic limit. We present exact integral expression and numerical value for…

A bi-Cayley graph over a cyclic group $\mathbb{Z}_n$ is called a bicirculant graph. Let $\Gamma=BC(\mathbb{Z}_n; R,T,S)$ be a bicirculant graph with $R=R^{-1}\subseteq \mathbb{Z}_n\setminus \{0\}$ and $T=T^{-1}\subseteq…

Consider spanning trees on the two-dimensional Sierpinski gasket SG(n) where stage $n$ is a non-negative integer. For any given vertex $x$ of SG(n), we derive rigorously the probability distribution of the degree $j \in \{1,2,3,4\}$ at the…

Spanning tree modulus is a generalization of effective resistance that is closely related to graph strength and fractional arboricity. The optimal edge density associated with spanning tree modulus is known to produce two hierarchical…

In this paper, we introduce a new method to construct evolving networks based on the construction of the Sierpinski gasket. Using self-similarity and renewal theorem, we obtain the asymptotic formula for average path length of our evolving…

In this paper we examine the classes of graphs whose $K_n$-complements are trees and quasi-threshold graphs and derive formulas for their number of spanning trees; for a subgraph $H$ of $K_n$, the $K_n$-complement of $H$ is the graph…

We prove that every oriented tree on $n$ vertices with bounded maximum degree appears as a spanning subdigraph of every directed graph on $n$ vertices with minimum semidegree at least $n/2+o(n)$. This can be seen as a directed graph…

Computing a Euclidean minimum spanning tree of a set of points is a seminal problem in computational geometry and geometric graph theory. We combine it with another classical problem in graph drawing, namely computing a monotone geometric…