Related papers: Eigenvalues of the normalized complex Laplacian on…

Determining and analyzing the spectra of graphs is an important and exciting research topic in theoretical computer science. The eigenvalues of the normalized Laplacian of a graph provide information on its structural properties and also on…

Let $(M,g)$ be a compact Riemannian manifold with a boundary of class $\mathscr{C}^{1}$. We are interested in the spectrum of the weighted Laplacian on $M$ with Neumann boundary conditions. More precisely, given $\rho$ and $\sigma$ two…

In this paper, two interesting eigenvalue comparison theorems for the first non-zero Steklov eigenvalue of the Laplacian have been established for manifolds with radial sectional curvature bounded from above. Besides, sharper bounds for the…

We prove various estimates for the first eigenvalue of the magnetic Dirichlet Laplacian on a bounded domain in two dimensions. When the magnetic field is constant, we give lower and upper bounds in terms of geometric quantities of the…

In this article we prove upper bounds for the Laplace eigenvalues $\lambda_k$ below the essential spectrum for strictly negatively curved Cartan-Hadamard manifolds. Our bound is given in terms of $k^2$ and specific geometric data of the…

We prove sharp criteria on the behavior of radial curvature for the existence of asymptotically flat or hyperbolic Riemannian manifolds with prescribed sets of eigenvalues embedded in the spectrum of the Laplacian. In particular, we…

Many popular graph metrics encode average properties of individual network elements. Complementing these conventional graph metrics, the eigenvalue spectrum of the normalized Laplacian describes a network's structure directly at a systems…

We introduce the notion of discrete cusp for a weighted graph. In this context, we provethat the form-domain of the magnetic Laplacian and that of thenon-magnetic Laplacian can be different. We establish the emptiness of the essential…

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…

Determining the effect of structural perturbations on the eigenvalue spectra of networks is an important problem because the spectra characterize not only their topological structures, but also their dynamical behavior, such as…

The Laplacian matrix of a simple graph is the difference of the diagonal matrix of vertex degree and the (0,1) adjacency matrix. In the past decades, the Laplacian spectrum has received much more and more attention, since it has been…

M.Levitin and E.Shargorodsky purposed in a recent article, [math.SP/0212087], the use of the so called ``second order relative spectrum'', to find eigenvalues of self-adjoint operators in gaps of the essential spectrum. Let $M$ be a…

This note introduces a result on the location of eigenvalues, i.e., the spectrum, of the Laplacian for a family of undirected graphs with self-loops. We extend on the known results for the spectrum of undirected graphs without self-loops or…

On any compact manifold of dimension greater than 3, we exhibit a metric whose first positive eigenvalue for the Laplacian acting on p-form is of multiplicity 2. As a corollary, we prescribe the volume and any finite part of the spectrum of…

We derive quantitative bounds for eigenvalues of complex perturbations of the indefinite Laplacian on the real line. Our results substantially improve existing results even for real-valued potentials. For $L^1$-potentials, we obtain optimal…

The concern of this paper is to clarify a relationship between the curvatures at infinity and the spectral structure of the Laplacian. In particular, this paper discusses the question of whether there is an eigenvalue of the Laplacian…

The second-largest eigenvalue and second-smallest Laplacian eigenvalue of a graph are measures of its connectivity. These eigenvalues can be used to analyze the robustness, resilience, and synchronizability of networks, and are related to…

The spectrum of the nonbacktracking matrix associated to a network is known to contain fundamental information regarding percolation properties of the network. Indeed, the inverse of its leading eigenvalue is often used as an estimate for…

We generalize the classical sharp bounds for the largest eigenvalue of the normalized Laplace operator, $\frac{N}{N-1}\leq \lambda_N\leq 2$, to the case of chemical hypergraphs.

Consider a semigraph $G=(V,\,E)$; in this paper, we study the eigenvalues of the Laplacian matrix of $G$. We show that the Laplacian of $G$ is positive semi-definite, and $G$ is connected if and only if $\lambda_2 >0.$ Along the similar…