Related papers: Optimization of the lowest eigenvalue for leaky st…
Let $G$ be a graph, and let $\lambda(G)$ denote the smallest eigenvalue of $G$. First, we provide an upper bound for $\lambda(G)$ based on induced bipartite subgraphs of $G$. Consequently, we extract two other upper bounds, one relying on…
We prove eigenvalue bounds for Schr\"odinger operator $-\Delta_g+V$ on compact manifolds with complex potentials $V$. The bounds depend only on an $L^q$-norm of the potential, and they are shown to be optimal, in a certain sense, on the…
In this paper, we obtain a lower bound for the smallest eigenvalue of a regular graph containing many copies of a smaller fixed subgraph. This generalizes a result of Aharoni, Alon, and Berger in which the subgraph is a triangle. We apply…
We describe the boundary conditions at the vertex that one must choose to obtain a dynamical system that best describes the low-energy part of the evolution of a quantum system confined to a very small neighbourhood of a star-shaped metric…
We establish a $\Gamma$-convergence result for $h\to 0$ of a thin nonlinearly elastic 3D-plate of thickness $h>0$ which is assumed to be glued to a support region in the 2D-plane $x_3=0$ over the $h$-2D-neighborhood of a given closed set…
We study nowhere-zero integer eigenvectors of the block graphs of Steiner triple systems and the Johnson graphs. For the first eigenvalue we obtain the minimums of $L_{\infty}$-norm for several infinite series of Johnson graphs, including…
We study strong instability (by blow-up) of the standing waves for the nonlinear Schr\"odinger equation with $\delta$-interaction on a star graph $\Gamma$. The key ingredient is a novel variational technique applied to the standing wave…
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…
Let $G$ be a connected uniform hypergraphs with maximum degree $\Delta$, spectral radius $\lambda$ and minimum H-eigenvalue $\mu$. In this paper, we give some lower bounds for $\Delta-\lambda$, which extend the result of [S.M. Cioab\u{a},…
The Steklov eigenvalue problem was introduced over a century ago, and its discrete form attracted interest recently. Let $D$ and $\delta \Omega$ be the maximum vertex degree and the set of vertices of degree one in a graph $\mathcal{G}$…
Signed graphs have their edges labeled either as positive or negative. $\rho(M)$ denote the $M$-spectral radius of $\Sigma$, where $M=M(\Sigma)$ is a real symmetric graph matrix of $\Sigma$. Obviously,…
We give lower bounds for the first non-zero Steklov eigenvalue on connected graphs. These bounds depend on the extrinsic diameter of the boundary and not on the diameter of the graph. We obtain a lower bound which is sharp when the cardinal…
In this paper we consider the vector-valued Schr\"{o}dinger operator $-\Delta + V$, where the potential term $V$ is a matrix-valued function whose entries belong to $L^1_{\rm loc}(\mathbb{R}^d)$ and, for every $x\in\mathbb{R}^d$, $V(x)$ is…
This paper deals with the eigenvalue problem for the operator $L=-\Delta -x\cdot \nabla $ with Dirichlet boundary conditions. We are interested in proving the existence of a set minimizing any eigenvalue $\lambda_k$ of $L$ under a suitable…
In this paper we introduce and study generally non-self-adjoint realizations of the Dirac operator on an arbitrary finite metric graph. Employing the robust boundary triple framework, we derive, in particular, a variant of the Birman…
This work studies geometrical characterizations of the essential spectrum $\sigma_{\text ess}$ of Schr\"odinger operators on graphs. Especially we focus on generalizing characterizations which are given in terms of the concept of right…
Let $\Omega\subset\mathbb{R}^N$, $N\geq 2$, be an open bounded connected set. We consider the fractional weighted eigenvalue problem $(-\Delta)^s u =\lambda \rho u$ in $\Omega$ with homogeneous Dirichlet boundary condition, where…
We give a proof of the Lieb-Thirring inequality in the critical case $d=1$, $\gamma= 1/2$, which yields the best possible constant.
Assignment of one of the two possible directions to every edge of an undirected graph $G=(V,E)$ is called an orientation of $G$. The resulting directed graph is denoted by $\overrightarrow{G}$. A strong orientation is one in which every…
The study of the scattering data for a star-shape network of LC-transmission lines is transformed into the scattering analysis of a Schr\"odinger operator on the same graph. The boundary conditions coming from the Kirchhoff rules ensure the…