Nodal geometry of graphs on surfaces

DOI10.3934/DCDS.2010.28.1291zbMATH Open1214.05095arXiv1307.3226OpenAlexW3104973892MaRDI QIDQ983486FDOQ983486

Authors: Yong Lin, Dan Mangoubi, Gabor Lippner, Shing-Tung Yau 

Publication date: 23 July 2010

Published in: Discrete and Continuous Dynamical Systems (Search for Journal in Brave)

Abstract: We prove two mixed versions of the Discrete Nodal Theorem of Davies et. al. [3] for bounded degree graphs, and for three-connected graphs of fixed genus $g$. Using this we can show that for a three-connected graph satisfying a certain volume-growth condition, the multiplicity of the $n$th Laplacian eigenvalue is at most $2left[6(n-1)+15(2g-2)ight{]}^2$. Our results hold for any Schr"odinger operator, not just the Laplacian.

Full work available at URL: https://arxiv.org/abs/1307.3226

Recommendations

• Nodal domain and eigenvalue multiplicity of graphs
• Discrete quantitative nodal theorem
• A lower bound for nodal count on discrete and metric graphs
• Nodal decompositions of graphs
• Nodal domain theorems and bipartite subgraphs

zbMATH Keywords

genusnodal domainmultiplicity of eigenvalues

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) General topics in linear spectral theory for PDEs (35P05) Discrete version of topics in analysis (39A12)

Cited In (5)

• Discrete quantitative nodal theorem
• Nodal inequalities on surfaces
• Nodal domain and eigenvalue multiplicity of graphs
• A relation between the multiplicity of the second eigenvalue of a graph Laplacian, Courant's nodal line theorem and the substantial dimension of tight polyhedral surfaces
• Symmetric matrices, signed graphs, and nodal domain theorems

This page was built for publication: Nodal geometry of graphs on surfaces

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q983486)