Eigenfunctions and Nodal Domains

Part of the Lecture Notes in Mathematics book series (LNM, volume 1915)

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).


Connected Graph Sign Pattern Boundary Edge Characteristic Edge Sign Graph 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Personalised recommendations