Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
Differential Geometry
2021-05-17 v3 Spectral Theory
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.
Keywords
Cite
@article{arxiv.2010.13969,
title = {Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs},
author = {Yongjie Shi and Chengjie Yu},
journal= {arXiv preprint arXiv:2010.13969},
year = {2021}
}
Comments
Some typos corrected