Related papers: Comparison between the first Steklov eigenvalue an…

We study the maximal Steklov eigenvalues of trees with given number of boundary vertices and total number of vertices. Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of…

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…

In this paper, two interesting eigenvalue comparison theorems for the first non-zero Steklov eigenvalue of the Laplacian have been established for manifolds with radial sectional curvature bounded from above. Besides, sharper bounds for the…

We introduce the Steklov flows on finite trees, i.e. the flows (or currents) associated with the Steklov problem. By constructing appropriate Steklov flows, we prove the monotonicity and rigidity of the first nonzero Steklov eigenvalues on…

We study the first nonzero Steklov eigenvalue $\lambda_2(T,\delta\Omega)$ of the Dirichlet-to-Neumann operator on a finite tree $T$ with leaf boundary $\delta\Omega$, under a constraint on the diameter $D$. He and Hua [Calc. Var. PDE, 2022]…

The Steklov eigenvalue problem was introduced over a century ago, and its discrete form attracted interest recently. Let $D$ and $\delta \Omega$ be the maximum vertex degree and the set of vertices of degree one in a graph $\mathcal{G}$…

In this paper, we obtain monotonicity of Steklov eigenvalues on graphs which as a special case on trees extends the results of He-Hua [Calc. Var. Partial Differential Equations 61 (2022), no. 3, Paper No. 101, arXiv: 2103.07696] to higher…

Let $T$ be a finite tree with leaf set $\dO$ as the boundary and let $\lambda_2$ be the first nontrivial Steklov eigenvalue. Let $D$ and $\ell$ be the maximum vertex degree and the number of leaves, respectively. Motivated by the spectral…

This paper studies eigenvalues of some Steklov problems. Among other things, we show the following sharp estimtes. Let $\Omega$ be a bounded smooth domain in an $n(\geq 2)$-dimensional Hadamard manifold an let $0=\lambda_0 < \lambda_1\leq…

In this article, we give computable lower bounds for the first non-zero Steklov eigenvalue $\sigma_1$ of a compact connected 2-dimensional Riemannian manifold $M$ with several cylindrical boundary components. These estimates show how the…

We study the biharmonic Steklov eigenvalue problem on a compact Riemannian manifold $\Omega$ with smooth boundary. We give a computable, sharp lower bound of the first eigenvalue of this problem, which depends only on the dimension, a lower…

We prove that in Riemannian manifolds the $k$-th Steklov eigenvalue on a domain and the square root of the $k$-th Laplacian eigenvalue on its boundary can be mutually controlled in terms of the maximum principal curvature of the boundary…

Consider a compact Riemannian manifold with boundary. In this short note we prove that under certain positive curvature assumptions on the manifold and its boundary the Steklov eigenvalues of the manifold are controlled by the Laplace…

Let $T$ be a tree with a given adjacency eigenvalue $\lambda$. In this paper, by using the $\lambda$-minimal trees, we determine the structure of trees with a given multiplicity of the eigenvalue $\lambda$. Furthermore, we consider the…

We establish a new lower bound for the first non-zero Steklov eigenvalue of a compact Riemannian manifold with non-negative Ricci curvature and (strictly) convex boundary. Related results are also obtained under weaker geometric hypotheses.

For a compact, connected, orientable Riemannian manifold with $b$ boundary components, we obtain geometric lower bounds for the low Steklov eigenvalues, namely $\sigma_k$, $1\le k\le b-1$. Our results complement earlier results, which apply…

Let $G$ be a connected tree on $n$ vertices and let $L = D-A$ denote the Laplacian matrix on $G$. The second-smallest eigenvalue $\lambda_{2}(G) > 0$, also known as the algebraic connectivity, as well as the associated eigenvector $\phi_2$…

We investigate the structure of trees that have minimal algebraic connectivity among all trees with a given degree sequence. We show that such trees are caterpillars and that the vertex degrees are non-decreasing on every path on…

We present a unified description of extremal metrics for the Laplace and Steklov eigenvalues on manifolds of arbitrary dimension using the notion of $n$-harmonic maps. Our approach extends the well-known results linking extremal metrics for…

Let $\mathcal{G}$ be the set of simple graphs (or multigraphs) $G$ such that for each $G \in \mathcal{G}$ there exists at least two non-empty disjoint proper subsets $V_{1},V_{2}\subseteq V(G)$ satisfying $V(G)\setminus(V_{1} \cup…