相关论文: Faber-Krahn inequalities for first Dirichlet eigen…

In this paper, motivated by our previous work \cite{HY}, we prove that the minimum of the first Dirichlet eigenvalues for the normalized combinatorial $p$-Laplacian on connected finite graphs with boundary consisting of $n$ edges is only…

The Faber-Krahn inequality states that among all open domains with a fixed volume in R^n, the ball minimizes the first Dirichlet eigenvalue of the Laplacian. We study an asymptotic discrete analogue of this for the combinatorial Dirichlet…

We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of the…

The Faber-Krahn inequality states that the ball has minimal first Dirichlet eigenvalue among all bounded domains with the fixed volume in $\mathbb{R}^n$. In this paper, we investigate the similar inequality for unicyclic graphs. The results…

While the classical Faber-Krahn inequality shows that the ball uniquely minimizes the first Dirichlet eigenvalue of the Laplacian in the continuum, this rigidity may fail in the discrete setting. We establish quantitative fluctuation…

We introduce the the fractional Laplacian on a subgraph of a graph with Dirichlet boundary condition. For a lattice graph, we prove the upper and lower estimates for the sum of the first $k$ Dirichlet eigenvalues of the fractional…

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…

We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…

In this paper, we establish a sharp lower bound for the first Dirichlet eigenvalue of the $p$-Laplacian on bounded domains of a complete, non-compact Riemannian manifold with non-negative Ricci curvature.

Inspired by the Li--Yau eigenvalue-diameter estimates, we investigate lower bounds for the first Dirichlet eigenvalue in terms of the diameter (or inscribed radius) of a graph. Let $G = (V, E)$ be a graph with boundary $B$. Assume that the…

In this paper, we mainly study eigenvalue problems of p-Laplacian on domains with an interior hole. Firstly we prove Faber-Krahn-type inequalities, and Cheng-type eigenvalue comparison theorems on manifolds. Secondly, we prove a comparison…

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…

We study the limit of first eigenfunctions of (discrete) $p$-Laplacian on a finite subset of a graph with Dirichlet boundary condition, as $p\to 1.$ We prove that up to a subsequence, they converge to a summation of characteristic functions…

We study the eigenvalue problem for the $p$-Laplacian on K\"ahler manifolds. Our first result is a lower bound for the first nonzero eigenvalue of the $p$-Laplacian on compact K\"ahler manifolds in terms of dimension, diameter, and lower…

Faber-Krahn functions provide lower bounds on the first Dirichlet eigenvalue of the Laplacian and are useful because they imply heat kernel upper bounds. In this paper, we are interested in Faber-Krahn functions and heat kernel estimates…

We prove interlacing inequalities between spectral minimal energies of metric graphs built on Dirichlet and standard Laplacian eigenvalues, as recently introduced in [Kennedy et al, arXiv:2005.01126]. These inequalities, which involve the…

We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.

In this paper, we study eigenvalues and eigenfunctions of $p$-Laplacians with Dirichlet boundary condition on graphs. We characterize the first eigenfunction (and the maximum eigenfunction for a bipartite graph) via the sign condition. By…

We consider a family of open sets $M_\epsilon$ which shrinks with respect to an appropriate parameter $\epsilon$ to a graph. Under the additional assumption that the vertex neighbourhoods are small we show that the appropriately shifted…

We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…