Normalized Laplacian Spectrum and Graph Invariant Formulas of Polygonized Graphs Based on Tridiagonal Matrices

Hao Li, Xinyi Chen and Hao Liu

Journal of Mathematics, 2026, vol. 2026, 1-12

Abstract: The polygonized graph Pn,kG is constructed from a simple connected graph G through a substitution process. During this process, each edge in G is replaced by one path of length 1 and k paths of length +1n,k≥1. Based on the properties of the determinants of tridiagonal matrices, we present a unified formula for computing the normalized Laplacian spectrum of Pn,kG from that of G. Moreover, we offer explicit formulas for calculating the number of spanning trees, Kemeny’s constant, and the multiplicative degree−Kirchhoff index of Pn,kG. In the educational context of graph theory and linear algebra, determinants serve as a valuable tool for exploring relevant graph parameters.

Date: 2026
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/jmath/2026/4974252.pdf (application/pdf)
http://downloads.hindawi.com/journals/jmath/2026/4974252.xml (application/xml)

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:hin:jjmath:4974252

DOI: 10.1155/jom/4974252

Access Statistics for this article

More articles in Journal of Mathematics from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().