Related papers: On Lichnerowicz sharp distance-regular graphs

In this paper, we investigate the first eigenvalue $\Lambda_1$ of the area Jacobi operator for complex curves in K\"ahler surfaces, establishing an extrinsic counterpart to the classical Lichnerowicz theorem for the Laplace-Beltrami…

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…

The purpose of this paper is to develop a "calculus" on graphs that allows graph theory to have new connections to analysis. For example, our framework gives rise to many new partial differential equations on graphs, most notably a new…

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 offer a new method for proving that the maximal eigenvalue of the normalized graph Laplacian of a graph with $n$ vertices is at least $\frac{n+1}{n-1}$ provided the graph is not complete and that equality is attained if and only if the…

In this note we give a new upper bound for the Laplacian eigenvalues of an unweighted graph. Let $G$ be a simple graph on $n$ vertices. Let $d_{m}(G)$ and $\lambda_{m+1}(G)$ be the $m$-th smallest degree of $G$ and the $m+1$-th smallest…

Let $(M,\theta)$ be a compact strictly pseudoconvex pseudohermitian manifold which is CR embedded into a complex space. In an earlier paper, Lin and the authors gave several sharp upper bounds for the first positive eigenvalue $\lambda_1$…

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…

Let $(\M^n, g)$ be a $n$ dimensional, complete ( compact or noncompact) Riemannian manifold whose Ricci curvature is bounded from below by a constant $-K \le 0$. Let $u$ be a positive solution of the heat equation on $\M^n \times (0,…

The definition of Ricci curvature on graphs was given in Lin-Lu-Yau, Tohoku Math., 2011, which is a variation of Ollivier, J. Funct. Math., 2009. Recently, a powerful limit-free formulation of Lin-Lu-Yau curvature using the graph Laplacian…

In this paper, we obtain a Lichnerowicz-type estimate for the first Steklov eigenvalues on graphs and discuss its rigidity.

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…

We prove the sharp estimate on the first nonzero eigenvalue of the p-laplacian on a compact Riemannian manifold with nonnegative Ricci curvature and possibly with convex boundary (in this case we assume Neumann b.c. on the p-laplacian). The…

Based on matrix perturbation theory, closed-form analytic expansions are studied for a Laplacian eigenvalue of an undirected, possibly weighted graph, which is close to a unique degree in that graph. An approximation is presented to provide…

Under mild assumptions, we show that a connected weighted graph $G$ with lower Ricci curvature bound $K>0$ in the sense of Bakry-\'Emery and the $d$-th non-zero Laplacian eigenvalue $\lambda_d$ close to $K$, with $d$ being the maximal…

In this paper, we prove that any simple $\{C_3,C_5\}$-free non-empty connected graph $G$ with LLY curvature bounded below by $\kappa>0$ has the order at most $2^{\frac{2}{\kappa}}$. This upper bound is achieved if and only if $G$ is a…

We study regular graphs whose distance-$2$ graph or distance-$1$-or-$2$ graph is strongly regular. We provide a characterization of such graphs $\Gamma$ (among regular graphs with few distinct eigenvalues) in terms of the spectrum and the…

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…

We study the linearization of a discrete transportation distance between probability distributions on finite weighted graphs originally due to Maas (``Gradient flows of the entropy for finite {M}arkov chains,'' J. Funct. Anal. 261(8), 2011)…

M. Aouchiche and P. Hansen proposed the distance Laplacian and the distance signless Laplacian of a connected graph [Two Laplacians for the distance matrix of a graph, LAA 439 (2013) 21{33]. In this paper, we obtain three theorems on the…