Related papers: The first Steklov eigenvalue of planar graphs and …

The Fiedler value $\lambda_2$, also known as algebraic connectivity, is the second smallest Laplacian eigenvalue of a graph. We study the maximum Fiedler value among all planar graphs $G$ with $n$ vertices, denoted by $\lambda_{2\max}$, and…

Let $G$ be a graph with adjacency matrix $A(G)$ and let $D(G)$ be the diagonal matrix of the degrees of $G$. For any real $\alpha\in [0,1]$, Nikiforov \cite{VN1} defined the matrix $A_{\alpha}(G)$ as $$A_{\alpha}(G)=\alpha…

Let $(\Omega^{n+1}, g)$ be an $(n+1)$-dimensional smooth compact connected Riemannian manifold with smooth boundary $\Sigma$, satisfying that ${\text{Ric}_{\Omega}}\ge 0$ and $\Sigma$ is strictly convex, more precisely, its second…

We investigate isoperimetric upper bounds for sums of consecutive Steklov eigenvalues of planar domains. The normalization involves the perimeter and scale-invariant geometric factors which measure deviation of the domain from roundness. We…

We present a new method for upper bounding the second eigenvalue of the Laplacian of graphs. Our approach uses multi-commodity flows to deform the geometry of the graph; we embed the resulting metric into Euclidean space to recover a bound…

Let $\lambda(G)$ be the smallest number of vertices that can be removed from a non-empty graph $G$ so that the resulting graph has a smaller maximum degree. Let $\lambda_{\rm e}(G)$ be the smallest number of edges that can be removed from…

We prove two upper bounds for the Steklov eigenvalues of a compact Riemannian manifold with boundary. The first involves the volume of the manifold and of its boundary, as well as packing and volume growth constants of the boundary and its…

For a finite, simple, and undirected graph $G$ with $n$ vertices, $m$ edges, and largest eigenvalue $\lambda$, Nikiforov introduced the degree deviation of $G$ as $s=\sum_{u\in V(G)}\left|d_G(u)-\frac{2m}{n}\right|$. Contributing to a…

The Steklov problem is an eigenvalue problem with the spectral parameter in the boundary conditions, which has various applications. Its spectrum coincides with that of the Dirichlet-to-Neumann operator. Over the past years, there has been…

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…

In the present paper, we study sharp isoperimetric inequalities for the first Steklov eigenvalue $\sigma_1$ on surfaces with fixed genus and large number $k$ of boundary components. We show that as $k\to \infty$ the free boundary minimal…

In this article, we study Steklov eigenvalues and mixed Steklov Neumann eigenvalues on a smooth bounded domain in $\mathbb{R}^{n}$, $n \geq 2$, having a spherical hole. We focus on two main results related to Steklov eigenvalues. First, we…

Let $G$ be an irregular graph on $n$ vertices with maximum degree $\Delta$ and diameter $D$. We show that \Delta-\lambda_1>\frac{1}{nD} where $\lambda_1$ is the largest eigenvalue of the adjacency matrix of $G$. We also study the effect of…

Bollob\'as and Nikiforov [J. Combin. Theory, Ser. B. 97 (2007) 859--865] conjectured the following. If $G$ is a $K_{r+1}$-free graph on at least $r+1$ vertices and $m$ edges, then $\lambda^2_1(G)+\lambda^2_2(G)\leq \frac{r-1}{r}\cdot2m$,…

We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…

The maximum number of vertices in a graph of maximum degree $\Delta\ge 3$ and fixed diameter $k\ge 2$ is upper bounded by $(1+o(1))(\Delta-1)^{k}$. If we restrict our graphs to certain classes, better upper bounds are known. For instance,…

In recent years, eigenvalue optimization problems have received a lot of attention, in particular, due to their connection with the theory of minimal surfaces. In the present paper we prove that on any orientable surface there exists a…

For a fixed positive integer $k$ and a graph $G$, let $\lambda_k(G)$ denote the $k$-th largest eigenvalue of the adjacency matrix of $G$. In 2017, Tait and Tobin proved that the maximum $\lambda_1(G)$ among all outerplanar graphs on $n$…

We study three types of fourth-order Steklov eigenvalue problems. For the first two of them, we derive the asymptotic expansion of their spectra on Euclidean annular domains $\mathbb{B}^n_1\setminus \overline{\mathbb{B}^n_\epsilon}$ as…

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…