Monotonicity of Steklov eigenvalues on graphs and applications

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

0

Turn this paper into a full lesson

ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…