Related papers: Largest Eigenvalue of the Laplacian Matrix

It is well known that the algebraic multiplicity of an eigenvalue of a graph (or real symmetric matrix) is equal to the dimension of its corresponding linear eigen-subspace, also known as the geometric multiplicity. However, for…

The normalized distance Laplacian of a graph $G$ is defined as $\mathcal{D}^\mathcal{L}(G)=T(G)^{-1/2}(T(G)-\mathcal{D}(G))T(G)^{-1/2}$ where $\mathcal{D}(G)$ is the matrix with pairwise distances between vertices and $T(G)$ is the diagonal…

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.

A Laplacian matrix is a square matrix whose row sums are zero. We study the limiting eigenvalue distribution of a Laplacian matrix formed by taking a random elliptic matrix and subtracting the diagonal matrix containing its row sums. Under…

Let $G$ be a graph of order $n,$ and let $q_{1}(G) \geq ...\geq q_{n}(G) $ be the eigenvalues of the $Q$-matrix of $G$, also known as the signless Laplacian of $G.$ In this paper we give a necessary and sufficient condition for the equality…

Let $G$ be a simple connected graph with order $n$. Let $\mathcal{L}(G)$ be the normalized Laplacian matrix of $G$. Let $\lambda_{k}(G)$ be the $k$-th smallest normalized Laplacian eigenvalue of $G$. Denote $\rho(A)$ the spectral radius of…

We consider the optimization problem of maximizing the $k$-th Laplacian eigenvalue, $\lambda_{k}$, over flat $d$-dimensional tori of fixed volume. For $k=1$, this problem is equivalent to the densest lattice sphere packing problem. For…

This work presents conjectures about eigenvalues of matrices associated with $k$-path graphs, the algebraic connectivity, defined as the second smallest eigenvalue of the Laplacian matrix, and the $\alpha$-index, as the largest eigenvalue…

The efficient inversion of matrix polynomials is a critical challenge in computational mathematics. We design a procedure to determine the inverse of matrices polynomial of multidimensional Laplace matrices. The method is based on…

The Laplacian energy of a graph is the sum of the distances of the eigenvalues of the Laplacian matrix of the graph to the graph's average degree. The maximum Laplacian energy over all graphs on $n$ nodes and $m$ edges is conjectured to be…

We prove new properties of the non-backtracking graph and the non-backtracking Laplacian for graphs. In particular, among other results, we prove that two simple graphs are isomorphic if and only if their corresponding non-backtracking…

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…

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…

The signless Laplacian matrix of a graph $G$ is defined to be the sum of its adjacency matrix and degree diagonal matrix, and its eigenvalues are called $Q$-eigenvalues of $G$. A $Q$-eigenvalue of a graph $G$ is called a $Q$-main eigenvalue…

We study the behavior of the eigenvectors associated with the smallest eigenvalues of the Laplacian matrix of temporal networks. We consider the multilayer representation of temporal networks, i.e. a set of networks linked through ordinal…

We prove existence results for optimization problems for the $k$th Laplace eigenvalue on closed Riemannian manifolds of dimension $m \geq 3$, depending on the choice of normalization. One such normalization leads to eigenvalue optimization…

In this paper we consider particular graphs defined by $\overline{\overline{\overline{K_{\alpha_1}}\cup K_{\alpha_2}}\cup\cdots \cup K_{\alpha_k}}$, where $k$ is even, $K_\alpha$ is a complete graph on $\alpha$ vertices, $\cup$ stands for…

We study the ground state energy of the Neumann magnetic Laplacian on planar domains. For a constant magnetic field we consider the question whether, under an assumption of fixed area, the disc maximizes this eigenvalue. More generally, we…

Let $G$ be a unicyclic graph. In this paper, we provide an upper bound for the number of Laplacian eigenvalues of $G$ within the interval $[0,1)$ in terms of the diameter and the girth of $G$.

The goal of this expository note is to give a short, self-contained proof of nearly optimal lower bounds for the second largest eigenvalue of the adjacency matrix of regular graphs.