Related papers: Universal lower bounds for Laplacians on weighted …
Results regarding off-diagonal Gaussian upper heat kernel bounds on discrete weighted graphs with possibly unbounded geometry are summarized and related. After reviewing uniform upper heat kernel bounds obtained by Carlen, Kusuoka, and…
In this paper, we study estimates for eigenvalues of the clamped plate problem. A sharp upper bound for eigenvalues is given and the lower bound for eigenvalues in [10] is improved.
Following Escobar [Esc97] and Jammes [Jam15], we introduce two types of isoperimetric constants and give lower bound estimates for the first nontrivial eigenvalues of Dirichlet-to-Neumann operators on finite graphs with boundary…
We consider the spectral structure of indefinite second order boundary-value problems on graphs. A variational formulation for such boundary-value problems on graphs is given and we obtain both full and half-range completeness results. This…
We study the Laplacian with zero magnetic field acting on complex functions of a planar domain $\Omega$, with magnetic Neumann boundary conditions. If $\Omega$ is simply connected then the spectrum reduces to the spectrum of the usual…
In this paper, we study the first eigenvalue of the Laplacian on doubly connected domains when Robin and Dirichlet conditions are imposed on the outer and the inner part of the boundary, respectively. We provide that the spherical shell…
We define a number of natural (from geometric and combinatorial points of view) deformation spaces of valuations on finite graphs, and study functions over these deformation spaces. These functions include both direct metric invariants…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We analyse spectral properties of this Laplacian under a Kirchhoff assumption. Moreover we establish isoperimet-ric inequalities in terms of the…
We show that the deficiency indices of the minimal Gaffney Laplacian on an infinite locally finite metric graph are equal to the number of finite volume graph ends. Moreover, we provide criteria, formulated in terms of finite volume graph…
We apply eigenvalue interlacing techniques for obtaining lower and upper bounds for the sums of Laplacian eigenvalues of graphs, and characterize equality. This leads to generalizations of, and variations on theorems by Grone, and Grone and…
Let $G$ be a simple connected graph on $n$ vertices and $m$ edges. In [Linear Algebra Appl. 435 (2011) 2570-2584], Lima et al. posed the following conjecture on the least eigenvalue $q_n(G)$ of the signless Laplacian of $G$: $\displaystyle…
Let $G=\left( V\left( G\right) ,E\left( G\right) \right) $ be an $\left( n,m\right) $-graph and $X$ a nonempty proper subset of $V\left( G\right) $. Let $X^{c}=V\left( G\right) \backslash X$.\ The edge density of $X$ in $G$ is given by…
Urschel introduced a notion of nodal partitioning to prove an upper bound on the number of nodal decomposition of discrete Laplacian eigenvectors. The result is an analogue to the well-known Courant's nodal domain theorem on continuous…
We consider the Laplacian in a domain squeezed between two parallel hypersurfaces in Euclidean spaces of any dimension, subject to Dirichlet boundary conditions on one of the hypersurfaces and Neumann boundary conditions on the other. We…
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…
The main objective of the present work is to study the negative spectrum of (differential) Laplace operators on metric graphs as well as their resolvents and associated heat semigroups. We prove an upper bound on the number of negative…
We prove that each eigenvalue l(k) of the Kirchhoff Laplacian K of a graph or quiver is bounded above by d(k)+d(k-1) for all k in {1,...,n}. Here l(1),...,l(n) is a non-decreasing list of the eigenvalues of K and d(1),..,d(n) is a…
We obtain a lower bound on each entry of the principal eigenvector of a non-regular connected graph.
We obtain upper estimates for the bottom (that is, greatest lower bound) of the essential spectrum of weighted Laplacian operator of a weighted manifold under assumptions of the volume growth of their geodesic balls and spheres.…