Related papers: Minimal Steklov eigenvalues on combinatorial graph…

We show that metrics that maximize the k-th Steklov eigenvalue on surfaces with boundary arise from free boundary minimal surfaces in the unit ball. We prove several properties of the volumes of these minimal submanifolds. For free boundary…

The grounded Laplacian matrix $\LL_{-S}$ of a graph $\calG=(V,E)$ with $n=|V|$ nodes and $m=|E|$ edges is a $(n-s)\times (n-s)$ submatrix of its Laplacian matrix $\LL$, obtained from $\LL$ by deleting rows and columns corresponding to…

For a graph $G$, let $S_2(G)$ be the sum of the first two largest signless Laplacian eigenvalues of $G$, and $f(G)=e(G)+3-S_2(G)$. Very recently, Zhou, He and Shan proved that $K^+_{1,n-1}$ (the star graph with an additional edge) is the…

A new class of isospectral graphs is presented. These graphs are isospectral with respect to both the normalised Laplacian on the discrete graph and the standard differential Laplacian on the corresponding metric graph. The new class of…

For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…

The degree-based entropy of a graph is defined as the Shannon entropy based on the information functional that associates the vertices of the graph with the corresponding degrees. In this paper, we study extremal problems of finding the…

In this paper we study Steklov eigenvalues for the Lam\'e operator which arise in the theory of linear elasticity. In this eigenproblem the spectral parameter appears in a Robin boundary condition, linking the traction and the displacement.…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

We prove sharp upper and lower bounds for the nodal length of Steklov eigenfunctions on real-analytic Riemannian surfaces with boundary. The argument involves frequency function methods for harmonic functions in the interior of the surface…

This paper studies the optimization of the lowest eigenvalue of the magnetic Steklov problem on planar domains. In the bounded domain setting and for magnetic fields of moderate strengths, we prove that among all simply-connected smooth…

We consider Steklov eigenvalues on nearly spherical and nearly annular domains in $d$ dimensions. By using the Green-Beltrami identity for spherical harmonic functions, the derivatives of Steklov eigenvalues with respect to the domain…

We develop a computational method for extremal Steklov eigenvalue problems and apply it to study the problem of maximizing the $p$-th Steklov eigenvalue as a function of the domain with a volume constraint. In contrast to the optimal…

Erd\H{o}s proved an upper bound on the number of edges in an $n$-vertex non-Hamiltonian graph with given minimum degree and showed sharpness via two members of a particular graph family. F\"{u}redi, Kostochka and Luo showed that these two…

For a given graph $\mathcal{G}$ of order $n$ with $m$ edges, and a real symmetric matrix associated to the graph, $M\left(\mathcal{G}\right)\in\mathbb{R}^{n\times n}$, the interlacing graph reduction problem is to find a graph…

We consider mixed Steklov-Dirichlet eigenvalue problem on smooth bounded domains in Riemannian manifolds. Under certain symmetry assumptions on multiconnected domains in $\mathbb{R}^{n}$ with a spherical hole, we obtain isoperimetric…

In this paper we revisit an approach pioneered by Auchmuty to approximate solutions of the Laplace- Robin boundary value problem. We demonstrate the efficacy of this approach on a large class of non-tensorial domains, in contrast with other…

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 paper we consider the optimization problem of generating graphs with a prescribed degree distribution, such that the correlation between the degrees of connected nodes, as measured by Spearman's rho, is minimal. We provide an…

We study the eigenvalues of the Dirichlet-to-Neumann operator on a finite subgraph of the integer lattice Zn. We estimate the first n+1 eigenvalues using the number of vertices of the subgraph. As a corollary, we prove that the first…

We offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…