Nodal domains on graphs - How to count them and why?

zbMath1194.05078arXiv0711.3416MaRDI QIDQ3545422

Idan Oren, Ram Band, Uzy Smilansky

Publication date: 10 December 2008

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

Mathematics Subject Classification ID

Enumeration in graph theory (05C30) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Boundary value problems on graphs and networks for ordinary differential equations (34B45)

Related Items (13)

Isospectral discrete and quantum graphs with the same flip counts and nodal counts ⋮ Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph ⋮ Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs ⋮ Nodal statistics on quantum graphs ⋮ Many nodal domains in random regular graphs ⋮ 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 ⋮ Nodal domain count for the generalized graph \(p\)-Laplacian ⋮ An elementary introduction to quantum graphs ⋮ Random matrices: tail bounds for gaps between eigenvalues ⋮ Eigenvectors of random graphs: Nodal Domains ⋮ On the distribution of local extrema in quantum chaos ⋮ On fully supported eigenfunctions of quantum graphs

This page was built for publication: Nodal domains on graphs - How to count them and why?