Related papers: Sharp bounds and monotonicity results for Neumann …

We introduce and study Laplacians on a finite metric graph endowed with generalized densities, that is, measures of finite mass. One important motivation is that this setting provides a common framework for several interesting classes of…

Let $M$ denote a compact, connected Riemannian manifold of dimension $n\in{\mathbb N}$. We assume that $ M$ has a smooth and connected boundary. Denote by $g$ and ${\rm d}v_g$ respectively, the Riemannian metric on $M$ and the associated…

The aim of this paper is give a simple proof of some results in \cite{Jun Ling-2006-IJM} and \cite{JunLing-2007-AGAG}, which are very deep studies in the sharp lower bound of the first eigenvalue in the Laplacian operator on compact…

For a simple and connected graph, several lower and upper bounds of graph invariants expressed in terms of the eigenvalues of the normalized Laplacian matrix have been proposed in literature. In this paper, through a unified approach based…

We complete the picture of sharp eigenvalue estimates for the p-Laplacian on a compact manifold by providing sharp estimates on the first nonzero eigenvalue of the nonlinear operator $\Delta_p$ when the Ricci curvature is bounded from below…

In this paper, we study the upper bounds for discrete Steklov eigenvalues on trees via geometric quantities. For a finite tree, we prove sharp upper bounds for the first nonzero Steklov eigenvalue by the reciprocal of the size of the…

We prove explicit and sharp eigenvalue estimates for Neumann $p$-Laplace eigenvalues in domains that admit a representation in Fermi coordinates. More precisely, if $\gamma$ denotes a non-closed curve in $\mathbb{R}^2$ symmetric with…

We study sharp asymptotics of the first eigenvalue on Riemannian surfaces obtained from a fixed Riemannian surface by attaching a collapsing flat handle or cross cap to it. Through a careful choice of parameters this construction can be…

Let $T$ be a tree on $n$ vertices with $q$-Laplacian $L_{T}^{q}$. Let $GTS_n$ be the generalized tree shift poset on the set of unlabelled trees with $n$ vertices. We prove that for all $q \in R$, going up on $GTS_n$ has the following…

In this paper, we derive an upper bound for higher order eigenvalues of the normalized Laplace operator associated with a symmetric finite graph in terms of lower order eigenvalues.

We consider the Steklov eigenvalues of the Laplace operator as limiting Neumann eigenvalues in a problem of boundary mass concentration. We discuss the asymptotic behavior of the Neumann eigenvalues in a ball and we deduce that the Steklov…

We study the structure of eigenfunctions of the Laplacian on quantum graphs, with a particular focus on Morse eigenfunctions via nodal and Neumann domains. Building on Courant-type arguments, we establish upper bounds for the number of…

In this thesis, we study Laplacian eigenfunctions on metric graphs, also known as quantum graphs. We restrict the discussion to standard quantum graphs. These are finite connected metric graphs with functions that satisfy Neumann vertex…

In this paper we prove an optimal upper bound for the first eigenvalue of a Robin-Neumann boundary value problem for the p-Laplacian operator in domains with convex holes. An analogous estimate is obtained for the corresponding torsional…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

We consider the Laplacian on a metric graph, equipped with Robin ($\delta$-type) vertex condition at some of the graph vertices and Neumann-Kirchhoff condition at all others. The corresponding eigenvalues are called Robin eigenvalues,…

We study an eigenvalue problem for the biharmonic operator with Neumann boundary conditions on domains of Riemannian manifolds. We discuss the weak formulation and the classical boundary conditions, and we describe a few properties of the…

We study positive solutions of semilinear elliptic equations in a planar triangular domain under mixed boundary conditions, consisting of homogeneous Dirichlet boundary conditions on one side and homogeneous Neumann boundary conditions on…

The von Neumann entropy of a graph is a spectral complexity measure that has recently found applications in complex networks analysis and pattern recognition. Two variants of the von Neumann entropy exist based on the graph Laplacian and…

This paper is devoted to the study of Lyapunov-type inequality for Neumann boundary conditions at higher eigenvalues. Our main result is derived from a detailed analysis about the number and distribution of zeros of nontrivial solutions and…