Journal of Combinatorics
Volume 3 (2012)
Nodal domain and eigenvalue multiplicity of graphs
Pages: 609 – 622
We give a uniform proof of the upper and lower bounds of strong nodal domains for generalized Laplacians of discrete graphs. We also study the set of all possible numbers of strong nodal domains and the maximum multiplicity sequence of spectra.
nodal domain, eigenvalue multiplicity, Laplacian
2010 Mathematics Subject Classification
Published 21 February 2013