Loading...
Loading...

Go to the content (press return)

The normalized Laplacian spectrum of subdivisions of a graph

Author
Xie, P.; Zhang, Z.; Comellas, F.
Type of activity
Journal article
Journal
Applied mathematics and computation
Date of publication
2016-08-05
Volume
286
First page
250
Last page
256
DOI
https://doi.org/10.1016/j.amc.2016.04.033 Open in new window
Project funding
Optimization techniques in graph theory, groups, and combinatorics. Applications to networks, algorithms, and communication protocols
Repository
http://arxiv.org/pdf/1510.02394v1.pdf Open in new window
http://hdl.handle.net/2117/104267 Open in new window
URL
http://www.sciencedirect.com/science/article/pii/S0096300316302831 Open in new window
Abstract
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 r...
Citation
Xie, P., Zhang, Z., Comellas, F. The normalized Laplacian spectrum of subdivisions of a graph. "Applied mathematics and computation", 5 Agost 2016, vol. 286, p. 250-256.
Keywords
Degree-Kirchhoff index, Kemeny’s constant, Normalized Laplacian spectrum, Spanning trees, Subdivision graph
Group of research
COMBGRAPH - Combinatorics, Graph Theory and Applications

Participants

Attachments