# zbMATH — the first resource for mathematics

On the spectrum of the normalized graph Laplacian. (English) Zbl 1149.05327
Summary: We investigate how the spectrum of the normalized (geometric) graph Laplacian is affected by operations like motif doubling, graph splitting or joining. The multiplicity of the eigenvalue 1, or equivalently, the dimension of the kernel of the adjacency matrix of the graph is of particular interest. This multiplicity can be increased, for instance, by motif doubling.

##### MSC:
 05C75 Structural characterization of families of graphs 47A75 Eigenvalue problems for linear operators
Full Text:
##### References:
 [1] Bevis, J.; Blount, K.; Davis, G.; Domke, G.; Miller, V., The rank of a graph after vertex addition, Linear algebra appl., 265, 55-69, (1997) · Zbl 0884.05061 [2] Bıyıkoğlu, T.; Leydold, J.; Stadler, P., Laplacian eigenvectors of graphs, vol. 1915, (2007), Springer LNM [3] Bolobás, B., Modern graph theory, (1998), Springer [4] Chung, F., Spectral graph theory, (1997), AMS [5] Gladwell, G.; Davies, E.; Leydold, J.; Stadler, P., Discrete nodal domain theorems, Linear algebra appl., 336, 51-60, (2001) · Zbl 0990.05093 [6] Ellingham, M., Basic subgraphs and graph spectra, Australas. J. combin., 8, 247-265, (1993) · Zbl 0790.05057 [7] Godsil, C.; Royle, G., Algebraic graph theory, (2001), Springer · Zbl 0968.05002 [8] Ipsen, M.; Mikhailov, A.S., Evolutionary reconstruction of networks, Phys. rev. E, 66, 4, (2002) [9] Jost, J.; Joy, M.P., Spectral properties and synchronization in coupled map lattices, Phys. rev. E, 65, 1, (2002) [10] Merris, R., Laplacian matrices of graphs – a survey, Linear algebra appl., 198, 143-176, (1994) · Zbl 0802.05053 [11] Mohar, B., Some applications of Laplace eigenvalues of graphs, (), 227-277 [12] P. Zhu, R. Wilson, A study of graph spectra for comparing graphs. · Zbl 1154.68505
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.