Related papers: Estimates of the first Dirichlet eigenvalue of gra…

In this paper, we study the higher Steklov eigenvalues of graphs on surfaces. We obtain the upper bound of higher Steklov eigenvalues of a finite graph $G$ with boundary $B$ and genus $g$ by using metrical deformation via probability flows.…

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…

In this paper, by extending the notions of harmonic transplantation and harmonic radius in the Heisenberg group, we give an upper bound for the first eigenvalue for the following Dirichlet problem: $$(P_{\Omega}) \left\{…

One of the central results in the representation theory of distance-regular graphs classifies distance-regular graphs with $\mu\geq 2$ and second largest eigenvalue $\theta_1= b_1-1$. In this paper we give a classification under the…

Let $\Omega$ be a bounded, smooth domain of $\mathbb R^N$, $N\ge 2$. In this paper, we prove some inequalities involving the first Robin eigenvalue of the $p$-laplacian operator. In particular, we prove an upper bound for the first Robin…

In this paper, we will give a structure theory for signed graphs with fixed smallest eigenvalue and investigate signed graphs with smallest eigenvalue greater than $-1-\sqrt{2}$. Given a real number $\lambda\leq -1$, we show that the…

In this paper, we study the eigenvalue problem \[\left\{\begin{array}{cl}-\hbox{div}\left(a(x)\frac{Du}{|Du|}\right)=\Lambda\, b(x)\frac{u}{|u|} & \text{in }\Omega\\u=0 & \text{on }\partial\Omega,\end{array}\right.\] where $a(x)$ and $b(x)$…

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…

Given a graph G of order n and size m, let s(G)= sum|d(u)-2m/n|, where the sum is taken over all vertices u of G. We investigate upper and lower bounds on eigenvalues of G in terms of s(G).

We improve Gilbert-Varshamov bound by graph spectral method. Gilbert graph $G_{q,n,d}$ is a graph with all vectors in $\mathbb{F}_q^n$ as vertices where two vertices are adjacent if their Hamming distance is less than $d$. In this paper, we…

Eigenvalues of a graph are the eigenvalues of the corresponding (0,1)-adjacency matrix. The second largest eigenvalue lambda_2 provides significant information on characteristics and structure of graphs. Therefore, finding bounds for…

The spectral radius $\rho(G)$ of a graph $G$ is the largest eigenvalue of its adjacency matrix $A(G)$. For a fixed integer $e\ge 1$, let $G^{min}_{n,n-e}$ be a graph with minimal spectral radius among all connected graphs on $n$ vertices…

We consider the first eigenvalue $\lambda_1(\Omega,\sigma)$ of the Laplacian with Robin boundary conditions on a compact Riemannian manifold $\Omega$ with smooth boundary, $\sigma\in\bf R$ being the Robin boundary parameter. When $\sigma>0$…

Jiang, Tidor, Yao, Zhang, and Zhao recently showed that connected bounded degree graphs have sublinear second eigenvalue multiplicity (always referring to the adjacency matrix). This result was a key step in the solution to the problem of…

For a graph $G$ of order $n$ and with eigenvalues $\lambda_1\geqslant\cdots\geqslant\lambda_n$, the HL-index $R(G)$ is defined as $R(G) ={\max}\left\{|\lambda_{\lfloor(n+1)/2\rfloor}|, |\lambda_{\lceil(n+1)/2\rceil}|\right\}.$ We show that…

We study the eigenvalues of the Dirichlet Laplace operator on an arbitrary bounded, open set in $\R^d$, $d \geq 2$. In particular, we derive upper bounds on Riesz means of order $\sigma \geq 3/2$, that improve the sharp Berezin inequality…

For $0\le \alpha\le 1$, Nikiforov proposed to study the spectral properties of the family of matrices $A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G)$ of a graph $G$, where $D(G)$ is the degree diagonal matrix and $A(G)$ is the adjacency matrix.…

In this article we present a new technique to obtain a lower bound for the principal Dirichlet eigenvalue of a fully nonlinear elliptic operator. We ilustrate the construction of an appropriate radial function required to obtain the bound…

We show that for any connected graph $G$ with maximum degree $d\ge3$, the spectral gap from $0$ with respect to the adjacency matrix is at most $\sqrt{d-1}$, with equality if and only if $G$ is the incidence graph of a finite projective…

In this paper, we classify distance regular graphs such that all of its second largest local eigenvalues are at most one. Also we discuss the consequences for the smallest eigenvalue of a distance-regular graph. These extend a result by the…