Spectral analysis for weighted level-3 Sierpiński graphs

Abstract

The spectrum of normalized Laplacian matrix of a network has attracted more and more attention because it is related to the structural properties and dynamical aspects of the network, specially in random walks. In this paper, we study the spectra and their applications of normalized Laplacian matrices for weighted level-3 Sierpiński graphs that are constructed in an iterative way. We analytically obtain all the spectra from two successive generations by applying the decimation method. Using the obtained spectra, we then derive closed-form expressions for their eigentime identity and number of spanning trees.