Pages that link to "Item:Q3545422"
From MaRDI portal
The following pages link to Nodal domains on graphs - How to count them and why? (Q3545422):
Displayed 13 items.
- Simplicity of eigenvalues and non-vanishing of eigenfunctions of a quantum graph (Q323869) (← links)
- Dynamics of nodal points and the nodal count on a family of quantum graphs (Q421123) (← links)
- The number of nodal domains on quantum graphs as a stability index of graph partitions (Q422394) (← links)
- Random matrices: tail bounds for gaps between eigenvalues (Q525097) (← links)
- On the distribution of local extrema in quantum chaos (Q736373) (← links)
- Nodal statistics on quantum graphs (Q1673725) (← links)
- On fully supported eigenfunctions of quantum graphs (Q2062630) (← links)
- Nodal domain count for the generalized graph \(p\)-Laplacian (Q2689133) (← links)
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts (Q3176511) (← links)
- Anomalous nodal count and singularities in the dispersion relation of honeycomb graphs (Q3463252) (← links)
- An elementary introduction to quantum graphs (Q4608449) (← links)
- Eigenvectors of random graphs: Nodal Domains (Q5198670) (← links)
- Many nodal domains in random regular graphs (Q6110149) (← links)