It is relatively easy to compute the number of nodal domains for a given eigenfunction1. Thus it is no problem to compute the possible number of nodal domains when all eigenvalues are simple. The situation changes completely in the case of degenerate eigenvalues because then the number of nodal domains may vary considerably depending on which eigenfunction from the r-dimensional eigenspace of λk is chosen. Hence, given a fixed graph G(V,E) and an eigenvalue λk of multiplicity r three questions immediately arise.
This is a preview of subscription content, log in via an institution to check access.
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). Computational Experiments. In: Laplacian Eigenvectors of Graphs. Lecture Notes in Mathematics, vol 1915. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73510-6_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-73510-6_5
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)