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.

References in corpus (10)

• Pseudofractal Scale-free Web
• Perron-Frobenius theorem for nonnegative multilinear forms and extensions
• Graph spectra and the detectability of community structure in networks
• Random walks on weighted networks
• Recursive graphs with small-world scale-free properties
• Further applications of the Container Method
• The Role of Kemeny's Constant in Properties of Markov Chains
• A general geometric growth model for pseudofractal scale-free web
• Evolving small-world scale-free networks consist of cliques
• Effect on normalized graph Laplacian spectrum by motif attachment and duplication

Cited by in corpus (13)

• Stochastic and mixed flower graphs
• The normalized Laplacian spectrum of $n$-polygon graphs and its applications
• Coherence Scaling of Noisy Second-Order Scale-Free Consensus Networks
• Spectra, hitting times, and resistance distances of $q$-subdivision graphs
• Exact evaluation of the causal spectrum and localization properties of electronic states on a scale-free network
• Spanning Trees of Recursive Scale-Free Graphs
• Kirchhoff index, multiplicative degree-Kirchhoff index and spanning trees of the linear crossed polyomino chains
• The normalized Laplacian, degree-Kirchhoff index and spanning trees of graphs derived from the strong prism of linear polyomino chain
• Hitting times and resistance distances of $q$-triangulation graphs: Accurate results and applications
• The normalized Laplacians and random walks of the parallel subdivision graphs
• The normalized Laplacian and related indexes of graphs with edges blew up by cliques
• The Laplacian spectrum, Kirchhoff index and complexity of the linear heptagonal networks
• Edge Domination Number and the Number of Minimum Edge Dominating Sets in Pseudofractal Scale-Free Web and Sierpiński Gasket