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...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/104267 |
| Acceso en línea: | https://hdl.handle.net/2117/104267 https://dx.doi.org/10.1016/j.amc.2016.04.033 |
| Access Level: | acceso abierto |
| Palabra clave: | Graph theory--Data processing Normalized Laplacian spectrum Subdivision graph Degree-Kirchhoff index Kemeny’s constant Spanning trees Laplace, Transformacions de Àrees temàtiques de la UPC::Matemàtiques i estadística |
| Sumario: | 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. |
|---|