Nodal domains on graphs;how to count them and why?

R Band, I Oren, U Smilansky

Research output: Chapter in Book/Report/Conference proceedingChapter in a book


The purpose of the present manuscript is to collect known results and present some new ones relating to nodal domains on graphs, with special emphasize on nodal counts. Several methods for counting nodal domains will be presented, and their relevance as a tool in spectral analysis will be discussed.
Translated title of the contributionNodal domains on graphs;how to count them and why?
Original languageEnglish
Title of host publicationAnalysis on Graphs and its Applications
EditorsPavel Exner, Jonathan P Keating, Peter Kuchning, Toshikazu Sunada, Alexander Teplyaev
PublisherAmerican Mathematical Society
Pages5 - 27
Number of pages23
ISBN (Print)0821844717
Publication statusPublished - 2012

Bibliographical note

Other: Proceedings of Symposia in Pure Mathematics

Fingerprint Dive into the research topics of 'Nodal domains on graphs;how to count them and why?'. Together they form a unique fingerprint.

Cite this