Related papers: The minimum Kirchhoff index of phenylene chains
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…
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…
The subdivision graph $S(G)$ of a graph $G$ is the graph obtained by inserting a new vertex into every edge of $G$. In $\cite{PL}$, two classes of new corona graphs, the corona-vertex of the subdivision graph $G_{1}\diamondsuit G_{2}$ and…
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.,…
In this paper, we derive closed-form formulas for resistance distance and Kirchhoff index of graphs with generalized pockets in terms of the resistance distance and Kirchhoff index of the factor graph.
Let $G$ be a connected graph. The resistance distance between two vertices $u$ and $v$ of $G$, denoted by $R_{G}[u,v]$, is defined as the net effective resistance between them in the electric network constructed from $G$ by replacing each…
Motivated by the notion of resistance distance on graph, we define a new resistance distance between two states on a given finite ergodic Markov chain based on its fundamental matrix. We prove a few equivalent formulations and discuss its…
The Wiener index W(G) of a connected graph $G$ is the sum of distances between all pairs of vertices in G$. In this paper, we first give the recurrences or explicit formulae for computing the Wiener indices of spiro and polyphenyl hexagonal…
We study three resistance distance-based graph invariants: the Kirchhoff index, and two modifications, namely, the multiplicative degree-Kirchhoff index and the additive degree-Kirchhoff index. In work in press, one of the present authors…
We define a subdivision network $\Gamma^S$ of a given network $\Gamma,$ by inserting a new vertex in every edge, so that each edge is replaced by two new edges with conductances that fulfill electrical conditions on the new network. In this…
The eccentric connectivity index of a connected graph $G$ is the sum over all vertices $v$ of the product $d_{G}(v) e_{G}(v)$, where $d_{G}(v)$ is the degree of $v$ in $G$ and $e_{G}(v)$ is the maximum distance between $v$ and any other…
Given a simple connected graph on $N$ vertices with size $|E|$ and degree sequence $d_{1}\leq d_{2}\leq ...\leq d_{N}$, the aim of this paper is to exhibit new upper and lower bounds for the additive degree-Kirchhoff index in closed forms,…
Let $G$ be a connected graph with $n$ vertices. The resistance distance $\Omega_{G}(i,j)$ between any two vertices $i$ and $j$ of $G$ is defined as the effective resistance between them in the electrical network constructed from $G$ by…
For a graph $G=(V,E)$, assigning each edge $e\in E$ a weight of a dual number $w(e)=1+\widehat{a}_{e}\varepsilon$, the weighted graph $G^{w}=(V,E,w)$ is called a dual number weighted graph, where $-\widehat{a}_{e}$ can be regarded as the…
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,…
Most previous work of centralities focuses on metrics of vertex importance and methods for identifying powerful vertices, while related work for edges is much lesser, especially for weighted networks, due to the computational challenge. In…
Let $S$ be a set of vertices of a connected graph $G$. The Steiner distance of $S$ is the minimum size of a connected subgraph of $G$ containing all the vertices of $S$. The sum of all Steiner distances on sets of size $k$ is called the…
The Wiener index of a connected graph is the sum of the distances between all unordered pairs of vertices. We provide formulae for the minimum Wiener index of simple triangulations and quadrangulations with connectivity at least $c$, and…
Simplifications of a result from a prior paper concerning the electric resistance between points in a distance-regular graph are given. In particular, we prove that the maximal resistance between points is bounded by twice the resistance…
Let $G$ be a connected graph. The Steiner distance $d(S)$ of a set $S$ of vertices is the minimum size of a connected subgraph of $G$ containing all vertices of $S$. For $k\in \mathbb{N}$, the Steiner $k$-Wiener index $SW_k(G)$ is defined…