Abstract
In this paper, we study the upper bounds for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, we prove sharp upper bounds for the first nonzero Steklov eigenvalue by the reciprocal of the size of the boundary and the diameter respectively. We also prove similar estimates for higher order Steklov eigenvalues.
Full Text
Submitted Version (
Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call