The normalized Laplacian spectrum of subdivisions of a graph

Determining and analyzing the spectra of graphs is an important and exciting research topic in mathematics science and theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on some relevant dynamical aspects, in particular those related to random walks. In this paper, we give the spectra of the normalized Laplacian of iterated subdivisions of simple connected graphs. As an example of application of these results we find the exact values of their multiplicative degree-Kirchhoff index, Kemeny's constant and number of spanning trees.Postprint (published version

Effective resistances and Kirchhoff index in subdivision networks

We define a subdivision network ¿S of a given network ¿; by inserting a new vertex in every edge, so that each edge is replaced by two new edges with conductances that fulfill electrical conditions on the new network. In this work, we firstly obtain an expression for the Green kernel of the subdivision network in terms of the Green kernel of the base network. Moreover, we also obtain the effective resistance and the Kirchhoff index of the subdivision network in terms of the corresponding parameters on the base network. Finally, as an example, we carry out the computations in the case of a wheel.Peer ReviewedPostprint (author's final draft