Upper bounds for the Steklov eigenvalues on trees

From MaRDI portal
Publication:2127338



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.


Upper bounds are given for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, sharp upper bounds are obtained for the first nonzero Steklov eigenvalue by the reciprocal of the size of the boundary and the diameter respectively. Similar estimates are given for higher-order Steklov eigenvalues.











This page was built for publication: Upper bounds for the Steklov eigenvalues on trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2127338)