相关论文: Counting the spanning trees of a directed line gra…

In this paper, we investigate normal trees of directed graphs, which extend the fundamental concept of normal trees of undirected graphs. We prove that a directed graph $D$ has a normal spanning tree if and only if the topological space…

We use a recently found generalization of the Cauchy-Binet theorem to give a new proof of the Chebotarev-Shamis forest theorem telling that det(1+L) is the number of rooted spanning forests in a finite simple graph G with Laplacian L. More…

We give a proof for sharp estimate for the number of spanning trees using linear algebra and generalize this bound to multigraphs. In addition, we show that this bound is tight for complete graphs. In addition, we give estimates for number…

We compute the total number of spanning trees for the generalized cone of the complete graph $K_n$ and a number of families of some modified bipartite graphs $K_{m,n}$. In particular, we obtain a new method of finding the number of spanning…

Let $N\geq 2$ be an integer, a (1, $N$)-periodic graph $G$ is a periodic graph whose vertices can be partitioned into two sets $V_1=\{v\mid\sigma(v)=v\}$ and $V_2=\{v\mid\sigma^i(v)\neq v\ \mbox{for any}\ 1<i<N\}$, where $\sigma$ is an…

We present a determinantal formula for the number of spanning trees of a complete multipartite graph containing a given spanning forest $F$. Our approach relies on the Generalized Matrix Determinant Lemma and Jacobi's formula for the…

Let $\mathcal{T}$ be the set of spanning trees of $G$ and let $L(T)$ be the number of leaves in a tree $T$. The leaf number $L(G)$ of $G$ is defined as $L(G)=\max\{L(T)|T\in \mathcal{T}\}$. Let $G$ be a connected graph of order $n$ and…

The number of spanning trees in a graph $G$ is the total number of distinct spanning subgraphs of $G$ that are trees. In this paper we characterize the unique graph with a prescribed vertex (resp. edge) connectivity, minimum degree and…

This note answers a question posed by Levine in arkiv:math.CO/0906.2809. The main result is Theorem 1 which shows that under certain circumstances a critical group of a directed graph is the quotient of a critical group of its directed line…

Building on work by Desjarlais, Molina, Faase, and others, a general method is obtained for counting the number of spanning trees of graphs that are a product of an arbitrary graph and either a path or a cycle, of which grid graphs are a…

A tree with at most k leaves is called k-ended tree, and a tree with exactly k leaves is called k-end tree, where a leaf is a vertex of degree one. Contraction of a graph G along the edge e means deleting the edge e and identifying its end…

Let $G_n$ be a linear crossed polyomino chain with $n$ four-order complete graphs. In this paper, explicit formulas for the Kirchhoff index, the multiplicative degree-Kirchhoff index and the number of spanning trees of $G_n$ are determined,…

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 paper, we explore some interesting applications of the matrix tree theorem. In particular, we present a combinatorial interpretation of a distribution of $(n-1)^{n-1}$, in the context of uprooted spanning trees of the complete graph…

In 2006, Bar\'at and Thomassen posed the following conjecture: for each tree $T$, there exists a natural number $k_T$ such that, if $G$ is a $k_T$-edge-connected graph and $|E(G)|$ is divisible by $|E(T)|$, then $G$ admits a decomposition…

The weighted spanning tree enumerator of a graph $G$ with weighted edges is the sum of the products of edge weights over all the spanning trees in $G$. In the special case that all of the edge weights equal $1$, the weighted spanning tree…

Using the theory of electrical network, we first obtain a simple formula for the number of spanning trees of a complete bipartite graph containing a certain matching or a certain tree. Then we apply the effective resistance (i.e.,…

We present a simple linear-time algorithm that finds a spanning tree $T$ of a given $2$-edge-connected graph $G$ such that each vertex $v$ of $T$ has degree at most $\lceil \frac{\deg_G(v)}{2}\rceil + 1$.

Given a connected undirected graph G = [V; E] where |E| =2(|V| -1), we present two algorithms to check if G can be decomposed into two edge disjoint spanning trees, and provide such a decomposition when it exists. Unlike previous algorithms…

Kirchhoff showed that the number of spanning trees of a graph is the spectral determinant of the combinatorial Laplacian divided by the number of vertices; we reframe this result in the quantum graph setting. We prove that the spectral…