In the previous chapter we have seen that (due to the Perron-Frobenius Theorem) the eigenfunctions of the first eigenvalue λ1 have all entries positive (or negative) for a generalized Laplacian matrix M of a connected graph G. Fiedler [67] has shown that for eigenfunctions of the smallest nonzero eigenvalue of a graph the subgraph induced by nonpositive vertices (i.e., vertices with nonpositive function values) and the subgraph induced by nonnegative vertices are both connected. In other words, an eigenfunction of the second eigenvalue has exactly two weak nodal domains (also called weak sign graphs).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
(2007). Eigenfunctions and Nodal Domains. In: Laplacian Eigenvectors of Graphs. Lecture Notes in Mathematics, vol 1915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73510-6_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-73510-6_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73509-0
Online ISBN: 978-3-540-73510-6
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)