Discrete nodal domain theorems
From MaRDI portal
Publication:5954844
DOI10.1016/S0024-3795(01)00313-5zbMath0990.05093arXivmath/0009120OpenAlexW2034647728WikidataQ56991819 ScholiaQ56991819MaRDI QIDQ5954844
Graham M. L. Gladwell, E. Brian Davies, Peter F. Stadler, Josef Leydold
Publication date: 7 August 2002
Published in: Linear Algebra and its Applications (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/math/0009120
General topics in linear spectral theory for PDEs (35P05) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Schrödinger operator, Schrödinger equation (35J10) Signed and weighted graphs (05C22)
Related Items (41)
Discrete quantitative nodal theorem ⋮ Generalized modularity matrices ⋮ Minimum supports of eigenfunctions of graphs: a survey ⋮ Graph Laplacians, nodal domains, and hyperplane arrangements ⋮ \(p\)-Laplace operators for oriented hypergraphs ⋮ Isospectral discrete and quantum graphs with the same flip counts and nodal counts ⋮ Rugged and Elementary Landscapes ⋮ Graph homomorphisms and nodal domains ⋮ Faber-Krahn type inequalities for trees ⋮ A theory of spectral partitions of metric graphs ⋮ The nodal count {0,1,2,3,…} implies the graph is a tree ⋮ An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian ⋮ Symmetric matrices, signed graphs, and nodal domain theorems ⋮ Nodal decompositions of graphs ⋮ Many nodal domains in random regular graphs ⋮ Nodal domain theorems for \(p\)-Laplacians on signed graphs ⋮ Graphs of given order and size and minimum algebraic connectivity ⋮ Dynamics of nodal points and the nodal count on a family of quantum graphs ⋮ Nodal domain count for the generalized graph \(p\)-Laplacian ⋮ Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering ⋮ Morse theory for discrete magnetic operators and nodal count distribution for graphs ⋮ Minimum vertex covers and the spectrum of the normalized Laplacian on trees ⋮ On the sign patterns of the smallest signless Laplacian eigenvector ⋮ A model for the emergence of the genetic code as a transition in a noisy information channel ⋮ The dual Cheeger constant and spectra of infinite graphs ⋮ On the spectrum of the normalized graph Laplacian ⋮ Zero forcing for sign patterns ⋮ Nodal domains of eigenvectors for 1-Laplacian on graphs ⋮ A lower bound for nodal count on discrete and metric graphs ⋮ Ordering trees and graphs with few cycles by algebraic connectivity ⋮ Algebraic connectivity and degree sequences of trees ⋮ On the isoperimetric spectrum of graphs and its approximations ⋮ Spectral theory of Laplace operators on oriented hypergraphs ⋮ Graphs and their real eigenvectors ⋮ Eigenvectors of random graphs: Nodal Domains ⋮ Dominant vertices in regulatory networks dynamics ⋮ On the distribution of local extrema in quantum chaos ⋮ On Pleijel's nodal domain theorem for quantum graphs ⋮ Physics-informed graph neural Galerkin networks: a unified framework for solving PDE-governed forward and inverse problems ⋮ Landscapes on spaces of trees ⋮ A discrete nodal domain theorem for trees
Cites Work
- Graph partitioning by eigenvectors
- Perron-Frobenius type results and discrete versions of nodal domain theorems
- Eigenfunctions and nodal sets
- Some geometric aspects of graphs and their eigenfunctions
- Eigenvectors of acyclic matrices
- Amplitude Spectra of Fitness Landscapes
- Courant's Nodal Line Theorem and Its Discrete Counterparts
- [https://portal.mardi4nfdi.de/wiki/Publication:4337503 Open problems of Paul Erd�s in graph theory]
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Discrete nodal domain theorems
