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

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…

Using methods in the spirit of deterministic homogenisation theory we obtain convergence of the Steklov eigenvalues of a sequence of domains in a Riemannian manifold to weighted Laplace eigenvalues of that manifold. The domains are obtained…

We prove generalized Cheeger inequalities for eigenvalues of Laplacians for reversible Markov chains. Then we apply Hassannezhad and Miclo's convergence result to obtain Jammes Cheeger inequalities for Steklov eigenvalues. In particular, we…

The Grundy number of a graph is the minimum number of colors needed to properly color the graph using the first-fit greedy algorithm regardless of the initial vertex ordering. Computing the Grundy number of a graph is an NP-Hard problem.…

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…

In this paper, we obtain sharp Faber-Krahn inequalities for the first Dirichlet eigenvalue of the combinatorial $p$-Laplacian on connected graphs with a fixed number of vertices or with a fixed number of edges. More precisely, we show that…

On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…

Let $(n^+, n^0, n^-)$ denote the inertia of a graph $G$ with $n$ vertices. Nordhaus-Gaddum bounds are known for inertia, except for an upper bound for $n^-$. We conjecture that for any graph \[ n^-(G) + n^-(\bar{G}) \le 1.5(n - 1), \] and…

In this note, we find a sharp upper bound for the Steklov spectrum on a submanifold of revolution in Euclidean space with one boundary component.

We obtain sharp lower bounds for the first eigenvalue of four types of eigenvalue problem defined by the bi-Laplace operator on compact manifolds with boundary and determine all the eigenvalues and the corresponding eigenfunctions of a…

We consider the Steklov-Dirichlet eigenvalue problem on eccentric annuli in Euclidean space of general dimensions. In recent work by the same authors of this paper [21], a limiting behavior of the first eigenvalue, as the distance between…

We present a finer quantitative version of an observation due to Breuillard, Green, Guralnick and Tao which tells that for finite non-bipartite Cayley graphs, once the nontrivial eigenvalues of their normalized adjacency matrices are…

Let M be a compact Riemannian manifold with boundary. Let b>0 be the number of connected components of its boundary. For manifolds of dimension at least 3, we prove that it is possible to obtain an arbitrarily large (b+1)-th Steklov…

Let $M$ be an $m$-dimensional compact Riemannian manifold with boundary. We obtain the upper bound of the harmonic mean of the first $m$ nonzero Neumann eigenvalues and Steklov eigenvalues involving the conformal volume and relative…

A graph $ G $ is minimally $ t $-tough if the toughness of $ G $ is $ t $ and deletion of any edge from $ G $ decreases its toughness. Katona et al. conjectured that the minimum degree of any minimally $ t $-tough graph is $ \lceil 2t\rceil…

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…

We prove a Cheeger inequality for the first positive Steklov eigenvalue. It involves two isoperimetric constants.

In communication field, an important issue is to group users and base stations to as many as possible subnetworks satisfying certain interference constraints. These problems are usually formulated as a graph partition problems which…

In this paper, we obtain a comparison of Steklov eigenvalues and Laplacian eigenvalues on graphs and discuss its rigidity. As applications of the comparison of eigenvalues, we obtain Lichnerowicz-type estimates and some combinatorial…

For every connected graph $G$ and surface $S$, we consider the well-known string of inequalities $\delta_S(G) \leq \mu_S(G) \leq \nu_S(G)$, where $\mu$ and $\nu$ denote skewness and crossing number and $\delta$ is the Euler-formula lower…