On the spectrum of the normalized Laplacian of iterated triangulations of graphs

On the spectrum of the normalized Laplacian of iterated triangulations of graphs

0.00 Avg rating0 Votes
Article ID: iaor201530184
Volume: 273
Start Page Number: 1123
End Page Number: 1129
Publication Date: Jan 2016
Journal: Applied Mathematics and Computation
Authors: , ,
Keywords: graphs, heuristics
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.

Reviews

Required fields are marked *. Your email address will not be published.