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

We study eigenvalue problems for intrinsic sub-Laplacians on regular sub-Riemannian manifolds. We prove upper bounds for sub-Laplacian eigenvalues $\lambda_k$ of conformal sub-Riemannian metrics that are asymptotically sharp as $k\to…

In this paper we study continuum limits of the discretized $p$-Laplacian evolution problem on sparse graphs with homogeneous Neumann boundary conditions. This extends the results of [24] to a far more general class of kernels, possibly…

We study Laplacians associated to a graph and single out a class of such operators with special regularity properties. In the case of locally finite graphs, this class consists of all selfadjoint, non-negative restrictions of the standard…

In this paper, we mainly study eigenvalue problems of p-Laplacian on domains with an interior hole. Firstly we prove Faber-Krahn-type inequalities, and Cheng-type eigenvalue comparison theorems on manifolds. Secondly, we prove a comparison…

It is known that the small eigenvalues of the Laplacian of a Riemann surface close to the boundary of the modular space can be well approximated by the eigenvalues of the discrete Laplacian on a certain graph coming from the pair of pants…

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 work in this thesis concerns the investigation of eigenvalues of the Laplacian matrix, normalized Laplacian matrix, signless Laplacian matrix and distance signless Laplacian matrix of graphs. In Chapter 1, we present a brief…

We study the eigenvalue problem for a system of fractional $p-$Laplacians, that is, $$ \begin{cases} (-\Delta_p)^r u = \lambda\dfrac{\alpha}p|u|^{\alpha-2}u|v|^{\beta} &\text{in } \Omega,\vspace{.1cm} (-\Delta_p)^s u =…

We discuss Neumann problems for self-adjoint Laplacians on (possibly infinite) graphs. Under the assumption that the heat semigroup is ultracontractive we discuss the unique solvability for non-empty subgraphs with respect to the vertex…

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…

We consider a non-compact Riemannian periodic manifold such that the corresponding Laplacian has a spectral gap. By continuously perturbing the periodic metric locally we can prove the existence of eigenvalues in a gap. A lower bound on the…

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 introduce the the fractional Laplacian on a subgraph of a graph with Dirichlet boundary condition. For a lattice graph, we prove the upper and lower estimates for the sum of the first $k$ Dirichlet eigenvalues of the fractional…

This paper studies nonlinear eigenvalues problems with a double non homogeneity governed by the $p(x)$-Laplacian operator, under the Dirichlet boundary condition on a bounded domain of $\mathbb{R}^N(N\geq2)$. According to the type of the…

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…

In this paper we study numerical approximations of the evolution problem for the nonlocal $p$-Laplacian operator with homogeneous Neumann boundary conditions on inhomogeneous random convergent graph sequences. More precisely, for networks…

In this paper, we introduce isocapacitary constants for the $p$-Laplacian on graphs and apply them to derive estimates for the first eigenvalues of the Dirichlet $p$-Laplacian, the Neumann $p$-Laplacian, and the $p$-Steklov problem.

In this paper we determine the graph whose least eigenvalue of signless Laplacian attains the minimum or maximum among all connected non-bipartite graphs of fixed order and given number of pendant vertices. Thus we obtain a lower bound and…

We present sharp inequalities relating the number of vertices, edges, and triangles of a graph to the smallest eigenvalue of its adjacency matrix and the largest eigenvalue of its Laplacian.

This paper surveys some recent results and progress on the extremal prob- lems in a given set consisting of all simple connected graphs with the same graphic degree sequence. In particular, we study and characterize the extremal graphs…