The following pages link to Discrete nodal domain theorems (Q5954844):
Displaying 41 items.
- Generalized modularity matrices (Q281985) (← links)
- Dynamics of nodal points and the nodal count on a family of quantum graphs (Q421123) (← links)
- Minimum vertex covers and the spectrum of the normalized Laplacian on trees (Q432729) (← links)
- Nodal domains of eigenvectors for 1-Laplacian on graphs (Q507213) (← links)
- On the distribution of local extrema in quantum chaos (Q736373) (← links)
- Discrete quantitative nodal theorem (Q820852) (← links)
- Graph homomorphisms and nodal domains (Q852625) (← links)
- Faber-Krahn type inequalities for trees (Q864896) (← links)
- On the spectrum of the normalized graph Laplacian (Q924372) (← links)
- A lower bound for nodal count on discrete and metric graphs (Q956633) (← links)
- Algebraic connectivity and degree sequences of trees (Q959888) (← links)
- On the isoperimetric spectrum of graphs and its approximations (Q974467) (← links)
- Dominant vertices in regulatory networks dynamics (Q1000724) (← links)
- Nodal decompositions of graphs (Q1688867) (← links)
- Landscapes on spaces of trees (Q1855800) (← links)
- A discrete nodal domain theorem for trees (Q1863531) (← links)
- Graph Laplacians, nodal domains, and hyperplane arrangements (Q1886532) (← links)
- An eigenvector interlacing property of graphs that arise from trees by Schur complementation of the Laplacian (Q1931722) (← links)
- Spectral theory of Laplace operators on oriented hypergraphs (Q2022161) (← links)
- On Pleijel's nodal domain theorem for quantum graphs (Q2051479) (← links)
- Physics-informed graph neural Galerkin networks: a unified framework for solving PDE-governed forward and inverse problems (Q2072742) (← links)
- \(p\)-Laplace operators for oriented hypergraphs (Q2135077) (← links)
- A model for the emergence of the genetic code as a transition in a noisy information channel (Q2216309) (← links)
- Ordering trees and graphs with few cycles by algebraic connectivity (Q2250940) (← links)
- Graphs of given order and size and minimum algebraic connectivity (Q2427902) (← links)
- On the sign patterns of the smallest signless Laplacian eigenvector (Q2438473) (← links)
- The dual Cheeger constant and spectra of infinite graphs (Q2445372) (← links)
- Zero forcing for sign patterns (Q2451650) (← links)
- A theory of spectral partitions of metric graphs (Q2663595) (← links)
- Nodal domain count for the generalized graph \(p\)-Laplacian (Q2689133) (← links)
- Pseudo-orthogonality for graph 1-Laplacian eigenvectors and applications to higher Cheeger constants and data clustering (Q2689707) (← links)
- Graphs and their real eigenvectors (Q2789408) (← links)
- The nodal count {0,1,2,3,…} implies the graph is a tree (Q2945348) (← links)
- Isospectral discrete and quantum graphs with the same flip counts and nodal counts (Q3176511) (← links)
- Rugged and Elementary Landscapes (Q3459673) (← links)
- Eigenvectors of random graphs: Nodal Domains (Q5198670) (← links)
- Minimum supports of eigenfunctions of graphs: a survey (Q5888902) (← links)
- Symmetric matrices, signed graphs, and nodal domain theorems (Q6039199) (← links)
- Many nodal domains in random regular graphs (Q6110149) (← links)
- Nodal domain theorems for \(p\)-Laplacians on signed graphs (Q6146940) (← links)
- Morse theory for discrete magnetic operators and nodal count distribution for graphs (Q6203838) (← links)
