Related papers: Bounds on eigenvalue ratios of quantum graphs

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.…

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…

On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…

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…

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…

We study the location of the spectrum of the Laplacian on compact metric graphs with complex Robin-type vertex conditions, also known as $\delta$ conditions, on some or all of the graph vertices. We classify the eigenvalue asymptotics as…

In this paper, we show that for all triangles in the plane, the equilateral triangle maximizes the ratio of the first two Dirichlet-Laplacian eigenvalues. This is an extension of work by Siudeja, who proved the inequality in the case of…

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…

We present a new, computer-assisted, proof that for all triangles in the plane, the equilateral triangle uniquely maximizes the ratio of the first two Dirichlet-Laplacian eigenvalues. This proves an independent proof the triangular…

The isoperimetric problem of maximizing all eigenvalues of the Laplacian on a metric tree graph within the class of trees of a given average edge length is studied. It turns out that, up to rescaling, the unique maximizer of the $k$-th…

We discuss Laplacian spectrum on a finite metric graph with vertex couplings violating the time-reversal invariance. For the class of star graphs we determine, under the condition of a fixed total edge length, the configurations for which…

We prove sharp upper bounds for eigenvalues of Schr\"odinger operators on quantum graphs with $\delta$-coupling (also known as Robin) conditions at all vertices. The bounds depend on the geometry of the graph, on the potential, and the…

We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…

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 provide explicit upper bounds for the eigenvalues of the Laplacian on a finite metric tree subject to standard vertex conditions. The results include estimates depending on the average length of the edges or the diameter. In particular,…

In this paper, we investigate the Dirichlet problem of Laplacian on complete Riemannian manifolds. By constructing new trial functions, we obtain a sharp upper bound of the gap of the consecutive eigenvalues in the sense of the order, which…

For a finite simple undirected graph $G$, let $\gamma(G)$ denote the size of a smallest dominating set of $G$ and $\mu(G)$ denote the number of eigenvalues of the Laplacian matrix of $G$ in the interval $[0,1)$, counting multiplicities.…

We prove that the optimal constant in the Lieb--Thirring inequality on a star graph with $N$ edges coincides with that on $\mathbb R$ if $N$ is even. For odd $N$ we show that this property holds when restricting to radial potentials and we…

We revisit the eigenvalue problem of the Dirichlet Laplacian on bounded domains in complete Riemannian manifolds. By building on classical results like Li-Yau's and Yang's inequalities, we derive upper and lower bounds for eigenvalues. For…

Comparing Neumann and Dirichlet eigenvalues of the Laplacian on a bounded domain $\Omega\subseteq\Rbb^n$ is a topic that goes back at least to the work of P\'olya \cite{polya}. We study the effect of the isoperimetric ratio of $\Omega$ on…