Monotonicity of Steklov eigenvalues on graphs and applications

From MaRDI portal
Publication:6203745

DOI10.1007/S00526-024-02683-YarXiv2112.12885MaRDI QIDQ6203745FDOQ6203745


Authors: Chengjie Yu, Yingtao Yu Edit this on Wikidata


Publication date: 8 April 2024

Published in: Calculus of Variations and Partial Differential Equations (Search for Journal in Brave)

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].


Full work available at URL: https://arxiv.org/abs/2112.12885




Recommendations



Cites Work






This page was built for publication: Monotonicity of Steklov eigenvalues on graphs and applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6203745)