References
- R.B. Bapat, Graphs and Matrices, Springer, New York, 2010.
- N. Biggs, Algebraic Graph Theory, 2nd ed., Cambridge University Press, Cambridge, 1993.
- Y. Cao, S.C. Li, and B. Xu, Explicit determination of three invariants associated with random walks on n-prism networks, Linear Multilinear Algebra. doi:https://doi.org/10.1080/03081087.2020.1777249
- A. Carmona, A.M. Encinas, and M. Mitjana, Effective resistances for ladder like chains, Int. J. Quantum Chem. 114 (2014), pp. 1670–1677.
- A. Carmona, A.M. Encinas, and M. Mitjana, Kirchhoff index of periodic linear chains, J. Math. Chem. 53 (2015), pp. 1195–1206.
- A.K. Chandra, P. Raghavan, W.L. Ruzzo, R. Smolensky, and P. Tiwari, The electrical resistance of a graph captures its commute and cover times, Comput. Complex 6 (1996), pp. 312–340.
- Z. Cinkir, Effective resistances and Kirchhoff index of ladder graphs, J. Math. Chem. 54 (2016), pp. 955–966.
- D. Dhar and A. Dhar, Distribution of sizes of erased loops for loop-erased random walks, Phys. Rev. E 55 (1997), p. R2093.
- I. Gutman, On distances in some bipartite graphs, Publ. Inst. Math. 43 (1988), pp. 3–8.
- I. Gutman and B. Mohar, The quasi-Wiener and the Kirchhoff indices coincide, J. Chem. Inf. Comput. Sci. 36 (1996), pp. 982–985.
- C.L. He, S.C. Li, W.J. Luo, and L.Q. Sun, Calculating the normalized Laplacian spectrum and the number of spanning trees of linear pentagonal chains, J. Comput. Appl. Math. 344 (2018), pp. 381–393.
- B.Y. Hou, H.J. Zhang, and L. Liu, Applications of Laplacian spectra for extended Koch networks, Eur. Phys. J. B 85 (2012), p. 30373.
- J. Huang, S.C. Li, and X.C. Li, The normalized Laplacian degree-Kirchhoff index and spanning trees of the linear polyomino chains, Appl. Math. Comput. 289 (2016), pp. 324–334.
- D.J. Klein and M. Randić, Resistance distance, J. Math. Chem. 12 (1993), pp. 81–95.
- S.C. Li, W.T. Sun, and S.J. Wang, Multiplicative degree-Kirchhoff index and number of spanning trees of a zigzag polyhex nanotube TUHC6[2n,2], Int. J. Quantum Chem. 119 (2019), p. e25969.
- Q. Li, S. Zaman, W. Sun, and J. Alam, Study on the normalized Laplacian of a Penta-graphene with applications, Int. J. Quantum Chem. 120 (2020), p. e26154.
- Y.G. Pan and J.P. Li, Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed hexagonal chains, Int. J. Quantum Chem. 118 (2018), p. e25787.
- Y.G. Pan and J.P. Li, Graphs that minimizing symmetric division deg index, MATCH Commun. Math. Comput. Chem. 82 (2019), pp. 43–55.
- Y.G. Pan, J.P. Li, S.C. Li, and W.J. Luo, On the normalized Laplacian with some classical parameters involving graph transformations, Linear Multilinear Algebra, 68 (8) (2020), pp. 1534–1556. doi:https://doi.org/10.1080/03081087.2018.1548556
- S. Patterson and B. Bamieh, Consensus and coherence in fractal networks, IEEE Trans. Control Netw. Syst. 1 (2014), pp. 338–348.
- Y.J. Peng and S.C. Li, On the Kirchhoff index and the number of spanning trees of linear phenylenes, MATCH Commun. Math. Comput. Chem. 77(3) (2017), pp. 765–780.
- Z.H. Wu, L.A. Braunstein, S. Havlin, and H.E. Stanley, Transport in weighted networks: Partition into superhighways and roads, Phys. Rev. Lett. 96 (2006), p. 148702.
- Y.L. Yang and T.Y. Yu, Graph theory of viscoelasticities for polymers with starshaped, multiple-ring and cyclic multiple-ring molecules, Makromol. Chem. 186 (1985), pp. 609–631.
- Y.J. Yang and H.P. Zhang, Kirchhoff index of linear hexagonal chains, Int. J. Quantum Chem. 108 (2008), pp. 503–512.
- S. Zaman, Cacti with maximal general sum-connectivity index, J. Appl. Math. Comput. 65 (2021), pp. 147–160.
- F.J. Zhang and W.G. Yan, Enumerating spanning trees of graphs with an involution, J. Combin. Theory Ser. A 116 (2009), pp. 650–662.
- J. Zhao, J.B. Liu, and S. Hayat, Resistance distance-based invariants and the number of spanning trees of linear crossed octagonal graphs, J. Appl. Math. Comput. 63 (2020), pp. 1–27. doi:https://doi.org/10.1007/s12190-019-01306-6
- H.Y. Zhu, D.J. Klein, and I. Lukovits, Extensions of the Wiener number, J. Chem. Inf. Comput. Sci.36 (1996), pp. 420–428.