Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
arXiv:2010.13969
Abstract
In this paper, we obtain a comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs and discuss its rigidity. As applications of the comparison of eigenvalues, we obtain Lichnerowicz-type estimates and some combinatorial estimates for Steklov eigenvalues on graphs.
Some typos corrected