A Lower Bound for Nodal Count on Discrete and Metric Graphs
- 4 December 2007
- journal article
- research article
- Published by Springer Nature in Communications in Mathematical Physics
- Vol. 278 (3) , 803-819
Abstract
No abstract availableKeywords
All Related Versions
This publication has 19 references indexed in Scilit:
- Nodal domains on isospectral quantum graphs: the resolution of isospectrality?Journal of Physics A: General Physics, 2006
- Genericity of simple eigenvalues for a metric graphIsrael Journal of Mathematics, 2005
- Resolving isospectral ‘drums’ by counting nodal domainsJournal of Physics A: General Physics, 2005
- Nodal counting on quantum graphsWaves in Random Media, 2004
- Oscillation Matrices and Kernels and Small Vibrations of Mechanical Systems2002
- Nodal Domains Statistics: A Criterion for Quantum ChaosPhysical Review Letters, 2002
- Discrete nodal domain theoremsLinear Algebra and its Applications, 2001
- Perron–Frobenius type results and discrete versions of nodal domain theoremsLinear Algebra and its Applications, 1999
- Some geometric aspects of graphs and their eigenfunctionsDuke Mathematical Journal, 1993
- Beziehungen zwischen den Eigenwerten und Eigenfunktionen verschiedener EigenwertproblemeMathematische Zeitschrift, 1936