Comparisons of Dirichlet, Neumann and Laplacian eigenvalues on graphs and their applications

2020/11/09 by Shi, Yongjie, Yu, Chengjie · 1 citation
#Differential Geometry (math.DG) #FOS: Mathematics #Spectral Theory (math.SP)

paper · doi:10.48550/arxiv.2011.04160

Abstract

In this paper, we obtain some comparisons of the Dirichlet, Neumann and Laplacian eigenvalues on graphs. We also discuss their rigidities and some of their applications including some Lichnerowicz-type, Fiedler-type and Friedman-type estimates for Dirichlet eigenvalues and Neumann eigenvalues. The comparisons on Neumann eigenvalues can be translated to comparisons on Steklov eigenvalues in our setting. So, some of the results can be viewed as extensions for parts of the works of \citeHHW by Hua-Huang-Wang, and parts of our previous works \citeSY,SY2.

Cited by

• Sharp bounds and monotonicity results for Neumann eigenvalues

Related

• Comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs
• Hardy-Muckenhoupt Bounds for Laplacian Eigenvalues
• A Lichnerowicz-type estimate for Steklov eigenvalues on graphs and its rigidity
• Upper bound for the Laplacian eigenvalues of a graph
• First eigenvalue estimates of Dirichlet-to-Neumann operators on graphs