Related papers: On Kirchhoff index and number of spanning trees of…

We establish several contraction formulas for Kirchhoff index. We relate Kirchhoff index with some other metrized graph invariants. By applying our contraction formulas successively when the graph is a tree, we derive new formulas for…

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,…

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.,…

Let $G_n$ be a graph obtained by the strong product of $P_2$ and $C_n$, where $n\geqslant3$. In this paper, explicit expressions for the Kirchhoff index, multiplicative degree-Kirchhoff index and number of spanning trees of $G_n$ are…

We give explicit formulas for resistance distance matrices and Moore-Penrose inverses of incidence and Laplacian matrices of ladder, circular ladder, and M\"{o}bius ladder graphs. As a result, we compute the Kirchhoff index of these graphs…

The spectrum of Laplacian and signless Laplacian matrix for a graph product is obtained, where both underlying graphs are regular. As an application of this, we have been able to generate the Kirchhoff Index and Wiener Index and determine…

The degree-Kirchhoff index of a connected graph is defined as the sum of the reciprocals of the non-zero eigenvalues of the normalized Laplacian matrix, each multiplied by the graph's total degree. Several studies have recently obtained…

Recently, Li et al. [Appl. Math. Comput. 382 (2020) 125335] proposed the problem of determining the Kirchhoff index and multiplicative degree-Kirchhoff index of graphs derived from $S_n \times K_2$, the Catersian product of the star $S_n$…

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…

The quadrilateral graph Q(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and 3, whereas the pentagonal graph W(G) is obtained from G by replacing each edge in G with two parallel paths of length 1 and…

The Kirchhoff index and degree-Kirchhoff index have attracted extensive attentions due to its practical applications in complex networks, physics, and chemistry. In 2019, Liu et al. [Int. J. Quantum Chem. 119 (2019) e25971] derived the…

Resistance distance is a novel distance function, also a new intrinsic graph metric, which makes some extensions of ordinary distance. Let On be a linear crossed octagonal graph. Recently, Pan and Li (2018) derived the closed formulas for…

By revisiting the Kirchhoff's Matrix-Tree Theorem, we give an exact formula for the number of spanning trees of a graph in terms of the quantum relative entropy between the maximally mixed state and another state specifically obtained from…

Let $B_n$ be a linear polyomino chain with $n$ squares. Let $B_n^2$ be the graph obtained by the strong prism of a linear polyomino chain with $n$ squares, i.e. the strong product of $K_2$ and $B_n$. In this paper, explicit expressions for…

We obtain a closed-form expression for the Wiener index of binomial trees. We outline efficient algorithms for computing the Wiener indices of Fibonacci and binary Fibonacci trees.

Using the method of spectral decimation and a modified version of Kirchhoffs Matrix-Tree Theorem, a closed form solution to the number of spanning trees on approximating graphs to a fully symmetric self-similar structure on a finitely…

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…

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…

In this article, we extend Moon's classic formula for counting spanning trees in complete graphs containing a fixed spanning forest to complete bipartite graphs. Let $(X,Y)$ be the bipartition of the complete bipartite graph $K_{m,n}$ with…

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…