The normalized Laplacian spectrum of subdivisions of a graph

Abstract

Determining and analyzing the spectra of graphs is an important and exciting research topic in 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.

Effects of heterogeneity in site–site couplings for tight-binding models on scale-invariant structures

“…Notice that by tracking the preimage of the spectrum T (t) under function R one can obtain only 2N t eigenvalues of T (t+1) . Fortunately, the left N t+1 − 2N t eigenvalues are uniformly 0 that is the only singularity of R. More detailed discussion about the iterative derivation of spectrum can be found at [45,46]. So far we are able to obtain the full spectrum of T (t) by tracking the flow generated by R. As t → ∞, the spectrum grows into a Julia set J R given as…”

VirtualMeshLab: Virtual laboratory for teaching Wireless Mesh Network

“…Due to its characteristics, the spectrum of Laplacian matrix is more important than the adjacency matrix for most of physical and chemical processes [23][24][25][26].…”

On the normalized Laplacian of Möbius phenylene chain and its applications

“…Hence, it is interesting to obtain the closed‐form formula for the multiplicative degree‐Kirchhoff index of graph G . For recent advances on this topic, one may be referred to and the references with in.…”