Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
More From: Journal of Algorithms & Computational Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.