arXiv · 2010.13969
Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
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.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Yongjie Shi, Chengjie Yu. 2021-05-14. Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs. https://arxiv.org/abs/2010.13969
Cite the original work for its findings. Save a collection to share your selection of sources.