Monotonicity of Steklov eigenvalues on graphs and applications
Differential Geometry
2022-05-16 v4 Combinatorics
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 [Calc. Var. Partial Differential Equations 61 (2022), no. 3, Paper No. 101, 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].
Cite
@article{arxiv.2112.12885,
title = {Monotonicity of Steklov eigenvalues on graphs and applications},
author = {Chengjie Yu and Yingtao Yu},
journal= {arXiv preprint arXiv:2112.12885},
year = {2022}
}
Comments
More typos corrected