Hexagonal and k-hexagonal graph's normalized Laplacian spectrum and applications

Hao Li, Xinyi Chen, Hao Liu

Substituting each edge of a simple connected graph $G$ by a path of length 1 and $k$ paths of length 5 generates the $k$-hexagonal graph $H^k(G)$. Iterative graph $H_n^k(G)$ is pro…