Open AccessApproximating graphs of a class of general Sierpinski triangles and their normalized Laplacian spectra
Author(s) -
Zhiyong Zhu
Publication year - 2021
Publication title -
journal of algorithms and computational technology
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.234
H-Index - 13
eISSN - 1748-3026
pISSN - 1748-3018
DOI - 10.1177/1748302621995927
Subject(s) - sierpinski triangle , spectrum (functional analysis) , class (philosophy) , laplace operator , mathematics , graph , combinatorics , relation (database) , spectral line , discrete mathematics , computer science , fractal , mathematical analysis , physics , data mining , artificial intelligence , quantum mechanics , astronomy
The normalized Laplacian spectrum of a graph is an important tool that one can use to find much information about its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we devise an essentially algorithm to obtain the approximating graphs of a class of general Sierpinski triangles and their normalized Laplacian spectra, and illustrate such algorithm by a quasi-program of Matlab. In the meantime, our work also enriches the graphs whose spectrum is known.