Related papers: Maximize the Steklov eigenvalue of trees

We consider Steklov eigenvalues of nearly hyperspherical domains in $\mathbb{R}^{d + 1}$ with $d\ge 3$. In previous work, treating such domains as perturbations of the ball, we proved that the Steklov eigenvalues are analytic functions of…

The threshold-$k$ metric dimension ($\mathrm{Tmd}_k$) of a graph is the minimum number of sensors -- a subset of the vertex set -- needed to uniquely identify any vertex in the graph, solely based on its distances from the sensors, when the…

We provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…

We develop a numerical method for solving shape optimization of functionals involving Steklov eigenvalues and apply it to the problem of maximization of the $k$-th Steklov eigenvalue, under volume constraint. A similar study in the planar…

We study the geometry of the first two eigenvalues of a magnetic Steklov problem on an annulus $\Sigma$ (a compact Riemannian surface with genus zero and two boundary components), the magnetic potential being the harmonic one-form having…

In this paper we prove that given a volume, among all domains with smooth boundary in rank-1 symmetric spaces of noncompact type, geodesic balls maximizes the first nonzero Steklov eigenvalue. We also prove a comparison result for the first…

We prove two explicit bounds for the multiplicities of Steklov eigenvalues $\sigma_k$ on compact surfaces with boundary. One of the bounds depends only on the genus of a surface and the index $k$ of an eigenvalue, while the other depends as…

The eccentricity matrix $\varepsilon(G)$ of a graph $G$ is constructed from the distance matrix of $G$ by keeping only the largest distances for each row and each column. This matrix can be interpreted as the opposite of the adjacency…

We study the Steklov problem on a subgraph with boundary $(\Omega,B)$ of a polynomial growth Cayley graph $\Gamma$. We prove that for each $k \in \mathbb{N}$, the $k^{\mbox{th}}$ eigenvalue tends to $0$ proportionally to…

In this paper we find an upper bound for the first Steklov eigenvalue for a surface of revolution with boundary consisting of two spheres of different radii. Moreover, we prove that in some cases this boundary is sharp.

In this paper, we analyze an optimization problem for the first (nonlinear) Steklov eigenvalue plus a boundary potential with respect to the potential function which is assumed to be uniformly bounded and with fixed $L^1$-norm.

For a graph $G$, let $\lambda_2(G)$ denote the second largest eigenvalue of the adjacency matrix of $G$. We determine the extremal trees with maximum/minimum adjacency eigenvalue $\lambda_2$ in the class $\mathcal{T}(n,d)$ of $n$-vertex…

We study ratios of eigenvalues of the Laplacian on compact metric graphs. Our goals are threefold: First, we prove a sharp Ashbaugh--Benguria-type bound for the ratio of the first two eigenvalues on compact trees with Dirichlet conditions…

This work is an extension of a result given by Kuttler and Sigillito (SIAM Rev $10$:$368-370$, $1968$) on a star-shaped bounded domain in $\mathbb{R}^2$. Let $\Omega$ be a star-shaped bounded domain in a hypersurface of revolution, having…

A variant of the Erd\H{o}s-S\'os conjecture, posed by Havet, Reed, Stein and Wood, states that every graph with minimum degree at least $\lfloor 2k/3 \rfloor$ and maximum degree at least $k$ contains a copy of every tree with $k$ edges.…

We study the counting function of Steklov eigenvalues on compact manifolds with boundary and obtain its upper bound involving the leading term of Weyl's law. Our estimate can be viewed as a weakened version of P\'{o}lya's Conjecture in the…

For a graph $G$, let $\lambda_1(G)$ and $\lambda_2(G)$ denote the largest and the second largest adjacency eigenvalue of $G$. The sum $\lambda_1(G) + \lambda_2(G)$ is called the \emph{spectral sum} of $G$. We investigate the spectral sum of…

In this paper, we address the problem of maximizing the Steklov eigenvalues with a diameter constraint. We provide an estimate of the Steklov eigenvalues for a convex domain in terms of its diameter and volume and we show the existence of…

We consider three different questions related to the Steklov and mixed Steklov problems on surfaces. These questions are connected by the techniques that we use to study them, which exploit symmetry in various ways even though the surfaces…

We study the Steklov problem on hypersurfaces of revolution with two boundary components in Euclidean space. In a recent article, the phenomenon of critical length, at which a Steklov eigenvalue is maximized, was exhibited and multiple…