2000-08.ebd-etal

Discrete Nodal Domain Theorems

E. Brian Davies, Graham M. L. Gladwell, Josef Leydold and Peter F. Stadler


Abstract

We give a detailed proof for two discrete analogues of Courant's Nodal Domain Theorem.

(See also 2000-07.ebd-ley-pfs.)


Mathematics Subject Classification:

Keywords: Graph Laplacian, Courant nodal domain theorem


Download Preprint


Josef.Leydold@statistik.wu-wien.ac.at