The authors establish new bounds on the Urschel number for graph Laplacian eigenvectors, including controls for multiple eigenvalues and classifications of zero vertices as shallow or deep.
Stadler, Laplacian eigenvectors of graphs, Lecture Notes in Mathematics, vol
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Urschel Nodal Domains via Perturbation Theory
The authors establish new bounds on the Urschel number for graph Laplacian eigenvectors, including controls for multiple eigenvalues and classifications of zero vertices as shallow or deep.