Related papers: Maximization of the first Laplace eigenvalue of a …

Given a length function on the set of edges of a finite graph, the corresponding Fujiwara Laplacian is defined. We consider a problem of maximizing the first nonzero eigenvalue of this graph Laplacian over all choices of edge-length…

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…

We discuss optimal lower bounds for eigenvalues of Laplacians on weighted graphs. These bounds are formulated in terms of the geometry and, more specifically, the inradius of subsets of the graph. In particular, we study the first non-zero…

We study the first eigenvalue of the $p-$Laplacian (with $1<p<\infty$) on a quantum graph with Dirichlet or Kirchoff boundary conditions on the nodes. We find lower and upper bounds for this eigenvalue when we prescribe the total sum of 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…

We investigate in this paper the existence of a metric which maximizes the first eigenvalue of the Laplacian on Riemannian surfaces. We first prove that, in a given conformal class, there always exists such a maximizing metric which is…

Building on seminal work of Nadirashvili and previous work of the authors, we prove the existence of metrics maximizing the area-normalized first eigenvalue of the Laplacian on every closed nonorientable surface, and give a simple new proof…

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…

In this paper, we characterize all graphs with eigenvectors of the signless Laplacian and adjacency matrices with components equal to $\{- 1, 0, 1\}.$ We extend the graph parameter max $k$-cut to square matrices and prove a general sharp…

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…

We introduce a new optimization problem regarding embeddings of a graph into a Euclidean space and discuss its relation to the two, mutually dual, optimizations problems introduced by Goering-Helmberg-Wappler. We prove that the Laplace…

We study the existence and properties of metrics maximising the first Laplace eigenvalue among conformal metrics of unit volume on Riemannian surfaces. We describe a general approach to this problem and its higher eigenvalue versions via…

Let $M$ be a closed hypersurface in a simply connected rank-1 symmetric space $\olm$. In this paper, we give an upper bound for the first eigenvalue of the Laplacian of $M$ in terms of the Ricci curvature of $\olm$ and the square of the…

Given a compact manifold equipped with a volume element and a Riemannian metric, we formulate and study a dual pair of optimization problems: one concerning smooth maps from the manifold into the Hilbert space $l^2$ and the other concerning…

We develop a nonlinear spectral graph theory, in which the Laplace operator is replaced by the 1-Laplacian ?$\Delta_1$. The eigenvalue problem is to solve a nonlinear system involving a set valued function. In the study, we investigate the…

Let $M$ be a closed hypersurface in $\mathbb{R}^{n}$ and $\Omega$ be a bounded domain such that $M= \partial\Omega$. In this article, we obtain an upper bound for the first non-zero eigenvalue of the following problems. \begin{itemize}…

In this paper, we prove new pinching theorems for the first eigenvalue of the Laplacian on compact hypersurfaces of the Euclidean space. These pinching results are associated with the upper bound for the first eigenvalue in terms of higher…

We study upper bounds for the first non-zero eigenvalue of the Steklov problem defined on finite graphs with boundary. For finite graphs with boundary included in a Cayley graph associated to a group of polynomial growth, we give an upper…

Eigenvalue behavior for the equation -\lambda y"=Vu on the edges of a graph G of final total length, with a non-negative weight function V and under the Kirchhoff matching conditions at the vertices and zero boundary condition at at least…

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…