Related papers: The graph $\infty$-Laplacian eigenvalue problem

In this note, we investigate upper bounds of the Neumann eigenvalue problem for the Laplacian of a bounded domain (with smooth boundary) in a given complete (not compact a priori) Riemannian manifold with Ricci bounded below . For this, we…

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…

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…

For a regular polyhedron (or polygon) centered at the origin, the coordinates of the vertices are eigenvectors of the graph Laplacian for the skeleton of that polyhedron (or polygon) associated with the first (non-trivial) eigenvalue. In…

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…

We give inequalities relating the eigenvalues of the adjacency matrix and the Laplacian of a graph, and its minimum and maximum degrees. The results are applied to derive new conditions for quasi-randomness of graphs.

We provide upper and lower bounds on the smallest eigenvalue of grounded Laplacian matrices (which are matrices obtained by removing certain rows and columns of the Laplacian matrix of a given graph). The gap between the upper and lower…

We prove upper bounds on the $L^p$ norms of eigenfunctions of the discrete Laplacian on regular graphs. We then apply these ideas to study the $L^p$ norms of joint eigenfunctions of the Laplacian and an averaging operator over a finite…

We consider higher-dimensional generalizations of the normalized Laplacian and the adjacency matrix of graphs and study their eigenvalues for the Linial-Meshulam model $X^k(n,p)$ of random $k$-dimensional simplicial complexes on $n$…

Here we have investigated a few properties of the eigenvalues of normalized (geometric) graph Laplacian in different graphs. Preservation of eigenvalue 1 from a particular subgraph to the entire graph, the spectrum of the graph constructed…

Let $G$ be a connected undirected graph with $n$, $n\ge 3$, vertices and $m$ edges. Denote by $\rho_1 \ge \rho_2 \ge \cdots > \rho_n =0$ the normalized Laplacian eigenvalues of $G$. Upper and lower bounds of $\rho_i$, $i=1,2,\ldots , n-1$,…

We present a method for proving upper bounds on the eigenvalues of the graph Laplacian. A main step involves choosing an appropriate "Riemannian" metric to uniformize the geometry of the graph. In many interesting cases, the existence of…

In this note we present upper bounds for the variational eigenvalues of the $p$-Laplacian on smooth domains of complete $n$-dimensional Riemannian manifolds and Neumann boundary conditions, and on compact (boundaryless) Riemannian…

We provide fundamental properties of the first eigenpair for fractional $p$-Laplacian eigenvalue problems under singular weights, which is related to Hardy type inequality, and also show that the second eigenvalue is well-defined. We obtain…

In this paper, we obtain sharp Faber-Krahn inequalities for the first Dirichlet eigenvalue of the combinatorial $p$-Laplacian on connected graphs with a fixed number of vertices or with a fixed number of edges. More precisely, we show that…

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…

In this paper, we investigate eigenvalues of the Dirichlet problem and the closed eigenvalue problem of drifting Laplacian on the complete metric measure spaces and establish the corresponding general formulas. By using those general…

We use two variational techniques to prove upper bounds for sums of the lowest several eigenvalues of matrices associated with finite, simple, combinatorial graphs. These include estimates for the adjacency matrix of a graph and for both…

This paper establishes new eigenvalue bounds for combinatorial Laplacians of simplicial complexes, extending previous results for flag complexes by Lew (2024) and general complexes by Shukla and Yogeshwaran (2020). Using elementary…

In this short survey, we derive some weyl-type universal inequalities of eigenvalues of the Laplacian on a closed Riemannian manifold of nonnegative Ricci curvature. We also give upper bounds for the $L_{\infty}$ norm of eigenfunctions of…