A lower bound for nodal count on discrete and metric graphs

DOI10.1007/s00220-007-0391-3zbMath1171.05356arXivmath-ph/0611026MaRDI QIDQ956633

Gregory Berkolaiko

Publication date: 25 November 2008

Published in: Communications in Mathematical Physics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/math-ph/0611026

Mathematics Subject Classification ID

05C50: Graphs and linear algebra (matrices, eigenvalues, etc.)

47B39: Linear difference operators

34B45: Boundary value problems on graphs and networks for ordinary differential equations

Related Items

Dynamics of nodal points and the nodal count on a family of quantum graphs, The number of nodal domains on quantum graphs as a stability index of graph partitions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Perron-Frobenius type results and discrete versions of nodal domain theorems
• Some geometric aspects of graphs and their eigenfunctions
• Periodic orbit theory and spectral statistics for quantum graphs
• The qualitative Sturm-Liouville theory on spatial networks
• Genericity of simple eigenvalues for a metric graph
• A discrete nodal domain theorem for trees
• Remarks on courant's nodal line theorem
• Nodal domains on isospectral quantum graphs: the resolution of isospectrality?
• Eigenvalue and nodal properties on quantum graph trees*
• Graph models for waves in thin structures
• Nodal counting on quantum graphs
• Resolving isospectral ‘drums’ by counting nodal domains
• Discrete nodal domain theorems