Related papers: The Kirchhoff's Matrix-Tree Theorem revisited: cou…

We focus on counting the number of labeled graphs on $n$ vertices and treewidth at most $k$ (or equivalently, the number of labeled partial $k$-trees), which we denote by $T_{n,k}$. So far, only the particular cases $T_{n,1}$ and $T_{n,2}$…

The classical matrix tree theorem relates the number of spanning trees of a connected graph with the product of the nonzero eigenvalues of its Laplacian matrix. The class of regular matroids generalizes that of graphical matroids, and a…

We consider the graph dynamical systems known as k-reversible processes. In such processes, each vertex in the graph has one of two possible states at each discrete time step. Each vertex changes its state between the current time and the…

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…

Let $G$ be a finite connected graph, and let $T$ be a spanning tree of $G$ chosen uniformly at random. The work of Kirchhoff on electrical networks can be used to show that the events $e_1 \in T$ and $e_2 \in T$ are negatively correlated…

We provide a structural description of, and invariants for, maximum spanning tree-packable graphs, i.e. those graphs G for which the edge connectivity of G is equal to the maximum number of edge-disjoint spanning trees in G. These graphs…

The quantum max-flow quantifies the maximal possible entanglement between two regions of a tensor network state for a fixed graph and fixed bond dimensions. In this work, we calculate the quantum max-flow exactly in the case of the bridge…

We consider quantum graphs with transparent branching points. To design such networks, the concept of transparent boundary conditions is applied to the derivation of the vertex boundary conditions for the linear Schrodinger equation on…

In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some…

This paper considers limit theorems associated with subgraph counts in the age-dependent random connection model. First, we identify regimes where the count of sub-trees converges weakly to a stable random variable under suitable…

This paper is a variation on the uniform spanning tree theme. We use random spanning forests to solve the following problem: for a Markov process on a finite set of size $n$, find a probability law on the subsets of any given size $m \leq…

We normalize the combinatorial Laplacian of a graph by the degree sum, look at its eigenvalues as a probability distribution and then study its Shannon entropy. Equivalently, we represent a graph with a quantum mechanical state and study…

The connection between the maximum spanning tree in a directed graph and the best dependency tree of a sentence has been exploited by the NLP community. However, for many dependency parsing schemes, an important detail of this approach is…

Characterization of joint probability distribution for large networks of random variables remains a challenging task in data science. Probabilistic graph approximation with simple topologies has practically been resorted to; typically the…

When $k|n$, the tree $\mathrm{Comb}_{n,k}$ consists of a path containing $n/k$ vertices, each of whose vertices has a disjoint path length $k-1$ beginning at it. We show that, for any $k=k(n)$ and $\epsilon>0$, the binomial random graph…

In this work, we study the color discrepancy of spanning trees in random graphs. We show that for the Erd\H{o}s-R\'enyi random graph $G(n,p)$ with $p$ above the connectivity threshold, the following holds with high probability: in every…

Chv\'{a}tal and Erd\"{o}s [Discrete Math. 2 (1972) 111-113] stated that, for an $m$-connected graph $G$, if its independence number $\alpha(G)\leq m-1$, then $G$ is Hamilton-connected. Note that $k$-leaf-connectedness is a natural…

While the notion of arboricity of a graph is well-known in graph theory, very few results are dedicated to the minimal number of trees covering the edges of a graph, called the tree number of a graph.

This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…

Generating graphs from a target distribution is a significant challenge across many domains, including drug discovery and social network analysis. In this work, we introduce a novel graph generation method leveraging $K^2$-tree…