Extension and rigidity of Perrin's lower bound estimate for Steklov eigenvalues on graphs

2025/04/10 by Shi, Yongjie, Yu, Chengjie · 4 citations
#Combinatorics (math.CO) #Differential Geometry (math.DG) #FOS: Mathematics #Spectral Theory (math.SP)

paper · doi:10.48550/arxiv.2504.07361

Abstract

In this paper, we extend a lower bound estimate for Steklov eigenvalues by Perrin \citePe on unit-weighted graphs to general weighted graphs and characterise its rigidity.

Cited by

• The first Steklov eigenvalue bound for graphs of positive genus
• Higher Steklov eigenvalues of graphs on surfaces
• A generalized Cheeger inequality and the Steklov Problem on finite graphs
• Comparison between the first Steklov eigenvalue and algebraic connectivity on trees

Related

• A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
• Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
• Lower bounds for the first eigenvalue of the Steklov problem on graphs
• Higher Steklov eigenvalues of graphs on surfaces
• Monotonicity of Steklov eigenvalues on graphs and applications