相关论文: On Kirchhoff index and number of spanning trees of…

Spectral theory has widely used in complex networks and solved some practical problems. In this paper, we investigated the Laplacian and normalized Laplacian spectra of Mobius polyomino networks by using spectral theory. Let Mn denote…

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…

Let $G=(V,E)$ be a loopless graph and $\mathcal{T}(G)$ be the set of all spanning trees of $G$. Let $L(G)$ be the line graph of the graph $G$ and $t(L(G))$ be the number of spanning trees of $L(G)$. Then, by using techniques from electrical…

By using biclique partitions of digraphs, this paper gives reduction formulas for the number of oriented spanning trees, stationary distribution vector and Kemeny's constant of digraphs. As applications, we give a method for enumerating…

We consider the number of spanning trees in circulant graphs of $\beta n$ vertices with generators depending linearly on $n$. The matrix tree theorem gives a closed formula of $\beta n$ factors, while we derive a formula of $\beta-1$…

For any connected multigraph $G=(V,E)$ and any $M\subseteq E$, if $M$ induces an acyclic subgraph of $G$ and removing all edges in $M$ yields a subgraph of $G$ whose components are complete graphs, a formula for $\tau_G(M)$ is obtained,…

We classify weakly connected spanning closed (WCSC) subgraphs of $\overrightarrow{C_n^2}$, the square of a directed $n$-vertex cycle. Then we show that every spanning tree of $\overrightarrow{C_n^2}$ is contained in a unique nontrivial WCSC…

Kirchhoff's matrix tree theorem is a well-known result that gives a formula for the number of spanning trees in a finite, connected graph in terms of the graph Laplacian matrix. A closely related result is Wilson's algorithm for putting the…

We introduce a ``Kirchhoff--Tur\'an'' variant of the extremal $C_4$ problem: among all simple connected $n$-vertex $C_4$-free graphs $G$, maximize the number of spanning trees $\tau(G)$. For the projective-plane orders $n=q^2+q+1$ we…

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…

Masbaum and Vaintrob's "Pfaffian matrix tree theorem" implies that counting spanning trees of a 3-uniform hypergraph (abbreviated to 3-graph) can be done in polynomial time for a class of "3-Pfaffian" 3-graphs, comparable to and related to…

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…

We explicitly compute the effective resistances between any two vertices of a prism graph by using circuit reductions and our earlier findings on a ladder graph. As an application, we derived a closed form formula for the Kirchhoff index of…

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…

The problems of maximizing the spectral radius and the number of spanning trees in a class of bipartite graphs with certain degree constraints are considered. In both the problems, the optimal graph is conjectured to be a Ferrers graph.…

The Wiener index of a graph, which is the sum of the distances between all pairs of vertices, has been well studied. Recently, Sills and Wang in 2012 proposed two conjectures on the maximal Wiener index of trees with a given degree…

Let $H$ be a graph with vertex set $V(H)=\{v_1, v_2, \cdots, v_k\}$. The generalized blow-up graph $H_{p_1,\ldots,p_k}^{q_1,\ldots,q_k}$ is constructed by replacing each vertex $v_i \in V(H)$ with the graph $G_i = p_iK_t \cup…

Using ideas from algebraic topology and statistical mechanics, we generalize Kirchhoff's network and matrix-tree theorems to finite CW complexes of arbitrary dimension. As an application, we give a formula expressing Reidemeister torsion as…

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…

The Wiener index of a connected graph is the sum of topological distances between all pairs of vertices. Since Wang gave a mistake result on the maximum Wiener index for given tree degree sequence, in this paper, we investigate the maximum…