The Laplacian Spectrum, Kirchhoff Index, and the Number of Spanning Trees of the Linear Heptagonal Networks

Jia-Bao Liu, Jing Chen, Jing Zhao and Shaohui Wang

Complexity, 2022, vol. 2022, issue 1

Abstract: Let Hn be the linear heptagonal networks with 2n heptagons. We study the structure properties and the eigenvalues of the linear heptagonal networks. According to the Laplacian polynomial of Hn, we utilize the method of decompositions. Thus, the Laplacian spectrum of Hn is created by eigenvalues of a pair of matrices: LA and LS of order numbers 5n + 1 and 4n + 1n!/r! (n − r)!, respectively. On the basis of the roots and coefficients of their characteristic polynomials of LA and LS, we get not only the explicit forms of Kirchhoff index but also the corresponding total number of spanning trees of Hn.

Date: 2022
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
https://doi.org/10.1155/2022/5584167

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wly:complx:v:2022:y:2022:i:1:n:5584167

Access Statistics for this article

More articles in Complexity from John Wiley & Sons
Bibliographic data for series maintained by Wiley Content Delivery ().