Monotonicity of Steklov eigenvalues on graphs and applications
Preprint
Abstract
In this paper, we obtain monotonicity of Steklov eigenvalues on graphs which as a special case on trees extends the results of He-Hua [arXiv: 2103.07696] to higher Steklov eigenvalues and gives affirmative answers to two problems proposed in He-Hua [arXiv: 2103.07696]. As applications of the monotonicity of Steklov eigenvalues, we obtain some estimates for Steklov eigenvalues on trees generalizing the isodiametric estimate for the first positive Steklov eigenvalues on trees in He-Hua [arXiv:2011.11014].Keywords
All Related Versions
This publication has 14 references indexed in Scilit:
- A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidityCalculus of Variations and Partial Differential Equations, 2022
- Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphsProceedings of the American Mathematical Society, 2022
- Isoperimetric Upper Bound for the First Eigenvalue of Discrete Steklov ProblemsThe Journal of Geometric Analysis, 2020
- Higher order Cheeger inequalities for Steklov eigenvaluesAnnales Scientifiques de lʼÉcole Normale Supérieure, 2020
- Lower bounds for the first eigenvalue of the Steklov problem on graphsCalculus of Variations and Partial Differential Equations, 2019
- First eigenvalue estimates of Dirichlet-to-Neumann operators on graphsCalculus of Variations and Partial Differential Equations, 2017
- The spectral gap of graphs and Steklov eigenvalues on surfacesElectronic Research Announcements in Mathematical Sciences, 2014
- The Legacy of Vladimir Andreevich SteklovNotices of the American Mathematical Society, 2014
- The first Steklov eigenvalue, conformal geometry, and minimal surfacesAdvances in Mathematics, 2011
- Some geometric aspects of graphs and their eigenfunctionsDuke Mathematical Journal, 1993