On the spectrum of the normalized Laplacian of iterated triangulations of graphs
Abstract
The eigenvalues of the normalized Laplacian of a graph provide information on its topological and structural characteristics and also on some relevant dynamical aspects, specifically in relation to random walks. In this paper we determine the spectra of the normalized Laplacian of iterated triangulations of a generic simple connected graph. As an application, we also find closed-forms for their multiplicative degree-Kirchhoff index, Kemeny's constant and number of spanning trees.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.