The normalized Laplacian spectrum of $n$-polygon graphs and its applications

Tengjie Chen, Zhenhua Yuan, Junhao Peng

Given an arbitrary connected $G$, the $n$-polygon graph ${\tau }_n(G)$ is obtained by adding a path with length $n$ $(n\ge 2)$ to each edge of graph $G$, and the iterated $n$-polygon gr…