Maximize the Steklov eigenvalue of trees
From MaRDI portal
Cites work
- A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
- Cheeger estimates of Dirichlet-to-Neumann operators on infinite subgraphs of graphs
- Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
- Dirichlet-to-Neumann maps for differential forms on graphs and their eigenvalues
- First eigenvalue estimates of Dirichlet-to-Neumann operators on graphs
- Higher order Cheeger inequalities for Steklov eigenvalues
- Isoperimetric upper bound for the first eigenvalue of discrete Steklov problems
- Lower bounds for the first eigenvalue of the Steklov problem on graphs
- Monotonicity of Steklov eigenvalues on graphs and applications
- Shape optimization for the Steklov problem in higher dimensions
- Sharp eigenvalue bounds and minimal surfaces in the ball
- Some recent developments on the Steklov eigenvalue problem
- Some results on higher eigenvalue optimization
- Steklov eigenvalue problem on subgraphs of integer lattices
- Sur les problèmes fondamentaux de la physique mathématique.
- The first Steklov eigenvalue of planar graphs and beyond
- The first Steklov eigenvalue, conformal geometry, and minimal surfaces
- The Legacy of Vladimir Andreevich Steklov
- The spectral gap of graphs and Steklov eigenvalues on surfaces
- The Yamabe problem on manifolds with boundary
- Upper bounds for Steklov eigenvalues of subgraphs of polynomial growth Cayley graphs
- Upper bounds for the Steklov eigenvalues on trees
This page was built for publication: Maximize the Steklov eigenvalue of trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6879289)
