The Laplacian spectrum significantly contributes the study of the structural features of non-regular networks. Actually, it emphasizes the interaction among the network eigenvalues and their structural properties. Let represent the pentagonal-derivation cylinder (Möbius) network. In this article, based on the decomposition techniques of the Laplacian characteristic polynomial, we initially determine that the Laplacian spectra of contain the eigenvalues of matrices and . Furthermore, using the relationship among the coefficients and roots of these two matrices, explicit calculations of the Kirchhoff index and spanning trees of are determined. The relationship between the Wiener and Kirchhoff indices of is also established.
The use of the global mean first-passage time (GMFPT) in random walks on networks has been widely explored in the field of statistical physics, both in theory and practical applications. The GMFPT is the estimated interval of time needed to reach a state j in a system from a starting state i. In contrast, there exists an intrinsic measure for a stochastic process, known as Kemeny’s constant, which is independent of the initial state. In the literature, it has been used as a measure of network efficiency. This article deals with a graph-spectrum-based method for finding both the GMFPT and Kemeny’s constant of random walks on spiro-ring networks (that are organic compounds with a particular graph structure). Furthermore, we calculate the Laplacian matrix for some specific spiro-ring networks using the decomposition theorem of Laplacian polynomials. Moreover, using the coefficients and roots of the resulting matrices, we establish some formulae for both GMFPT and Kemeny’s constant in these spiro-ring networks.
30 March 2026 in International Journal of Geometric Methods in Modern Physics