Spectral techniques and mathematical aspects of K4 chain graph

The resistance distance between any two vertices of a connected graph is defined as the net effective resistance between them. An electrical network can be constructed from a graph by replacing each edge with a unit resistor. Resistance distances are computed by methods of the theory of resistive electrical networks (based on Ohm's and Kirchhoff's laws). The standard method to compute resistance distance is via the Moore-Penrose generalized inverse of the Laplacian matrix of the underlying graph G. In this article, we used the electric network approach and the combinatorial approach, to derive the exact expression for resistance distances between any two vertices of the K-4(n). ring model. By employing a recursive connection, firstly we determined all the eigenvalues and their multiplicities in relation to the corresponding Laplacian and normalised matrices. Secondly, we obtained the Kirchhoff index and multiplicative degree Kirchhoff index for K-4(n). Finally, we calculated the mean first passage time and Kemeny constant of K-4(n). Our computed results provide a comprehensive approach for exploring random walks on complex networks, especially biased random walks, which may also help to better understand and tackle some practical problems such as search and routing on networks.

Automated summary

In this article, the exact expression for resistance distances between any two vertices of the K-4(n) ring model was derived using the electric network approach and the combinatorial approach. The Kirchhoff index, multiplicative degree Kirchhoff index, mean first passage time, and Kemeny constant of K-4(n) were also calculated. These computed results provide a comprehensive approach for exploring random walks on complex networks and may help to solve practical problems such as search and routing on networks.