Related papers: Lower bounds for the first eigenvalue of the Stekl…

In this paper, we give infinitely many examples of (non-isomorphic) connected $k$-regular graphs with smallest eigenvalue in half open interval $[-1-\sqrt2, -2)$ and also infinitely many examples of (non-isomorphic) connected $k$-regular…

In this paper, we study extremal problems of Steklov eigenvalues on combinatorial graphs by extending Friedman's theory [Duke Math. J. 69 (1993), no. 3, 487--525] of nodal domains for Laplacian eigenfunctions to Steklov eigenfunctions, and…

A basic fact in spectral graph theory is that the number of connected components in an undirected graph is equal to the multiplicity of the eigenvalue zero in the Laplacian matrix of the graph. In particular, the graph is disconnected if…

The smallest eigenvalue of a graph is the smallest eigenvalue of its adjacency matrix. We show that the family of graphs with smallest eigenvalue at least $-\lambda$ can be defined by a finite set of forbidden induced subgraphs if and only…

In this paper, we obtain two spectral upper bounds for the $k$-independence number of a graph which is is the maximum size of a set of vertices at pairwise distance greater than $k$. We construct graphs that attain equality for our first…

In the first part, we derive monotonicity of the normalized spectra for the second-order Steklov problem and two fourth-order Steklov problems on the $2$-dimensional geodesic disks with respect to the geodesic radius in the sphere and 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…

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…

Let $G$ be a large (simple, unlabeled) dense graph on $n$ vertices. Suppose that we only know, or can estimate, the empirical distribution of the number of subgraphs $F$ that each vertex in $G$ participates in, for some fixed small graph…

In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…

We investigate upper bounds for the spectral ratios and gaps for the Steklov eigenvalues of balls with revolution-type metrics. We do not impose conditions on the Ricci curvature or on the convexity of the boundary. We obtain optimal upper…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

In this paper, using new correction to the Crouzeix-Raviart finite element eigenvalue approximations, we obtain lower eigenvalue bounds for the Steklov eigenvalue problem with variable coefficients on d-dimensional domains (d = 2,3). In…

In this paper we determine the graph whose least eigenvalue of signless Laplacian attains the minimum or maximum among all connected non-bipartite graphs of fixed order and given number of pendant vertices. Thus we obtain a lower bound and…

We give the lower bound for the growth of the maximum value for a solution to the minimal surface equation with 0 boundary values over an unbounded simply connected domain.

In study of eigenvalue problems, a classical problem is the Stekloff eigenvalue problem. There are many estimates of the first non- zero Stekloff eigenvalue, including a sharp estimate on surfaces, obtained by Escobar in "The geometry of…

This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…

Recently, D. Bucur and M. Nahon used boundary homogenisation to show the remarkable flexibility of Steklov eigenvalues of planar domains. In the present paper we extend their result to higher dimensions and to arbitrary manifolds with…

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…

This work deals with theoretical and numerical aspects related to the behavior of the Steklov-Lam\'e eigenvalues on variable domains. After establishing the eigenstructure for the disk, we prove that for a certain class of Lam\'e…