Related papers: Spectral Theory of Laplace Operators on Oriented H…

We write the spectral zeta function of the Laplace operator on an equilateral metric graph in terms of the spectral zeta function of the normalized Laplace operator on the corresponding discrete graph. To do this, we apply a relation…

In graph theory there are intimate connections between the expansion properties of a graph and the spectrum of its Laplacian. In this paper we define a notion of combinatorial expansion for simplicial complexes of general dimension, and…

We study the spectrum of the Laplacian on the hemisphere with Robin boundary conditions. It is found that the eigenvalues fall into small clusters around the Neumann spectrum, and satisfy a Szeg\H{o} type limit theorem. Sharp upper and…

We establish inequalities for the eigenvalues of Schr\"odinger operators on compact submanifolds (possibly with nonempty boundary) of Euclidean spaces, of spheres, and of real, complex and quaternionic projective spaces, which are related…

We introduce submodular hypergraphs, a family of hypergraphs that have different submodular weights associated with different cuts of hyperedges. Submodular hypergraphs arise in clustering applications in which higher-order structures carry…

In this article, we study relations between the local geometry of planar graphs (combinatorial curvature) and em global geometric invariants, namely the Cheeger constants and the exponential growth. We also discuss spectral applications.

This paper deals with spectral graph theory issues related to questions of monotonicity and comparison of eigenvalues. We consider finite directed graphs with non symmetric edge weights and we introduce a special self-adjoint operator as…

The normalized distance Laplacian matrix $\mathcal{D}^{\mathcal{L}}(G)$ of a graph $G$ is a natural generalization of the normalized Laplacian matrix, arising from the matrix of pairwise distances between vertices rather than the adjacency…

In this paper, we give spectral upper bounds for the independence number of even uniform hypergraphs and graphs, extend the Hoffman bound to even uniform hypergraphs, and give a simple spectral condition for determining the independence…

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$,…

In this article we prove a generalization of Weyl's criterion for the spectrum of a self-adjoint nonnegative operator on a Hilbert space. We will apply this new criterion in combination with Cheeger-Fukaya-Gromov and Cheeger-Colding theory…

We establish a sharp lower bound on the first non-trivial eigenvalue of the Laplacian on a metric graph equipped with natural (i.e., continuity and Kirchhoff) vertex conditions in terms of the diameter and the total length of the graph.…

For two simple graphs $G_1$ and $G_2$, we denote the subdivision-vertex join and subdivision-edge join of $G_1$ and $G_2$ by $G_1\dot{\vee}G_2$ and $G_1\veebar G_2$, respectively. This paper determines the normalized Laplacian spectra of…

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…

The main objective of the present work is to study the negative spectrum of (differential) Laplace operators on metric graphs as well as their resolvents and associated heat semigroups. We prove an upper bound on the number of negative…

We propose a flexible framework for defining the 1-Laplacian of a hypergraph that incorporates edge-dependent vertex weights. These weights are able to reflect varying importance of vertices within a hyperedge, thus conferring the…

The spectral determinant of the Schr\"odinger operator ($ - \Delta + V(x) $) on a graph is computed for general boundary conditions. ($\Delta$ is the Laplacian and $V(x)$ is some potential defined on the graph). Applications to restricted…

A generalized Fourier analysis on arbitrary graphs calls for a detailed knowledge of the eigenvectors of the graph Laplacian. Using the symmetries of the Cayley tree, we recursively construct the family of eigenvectors with exponentially…

We study the asymptotic behavior of the solutions of a spectral problem for the Laplacian in a domain with rapidly oscillating boundary. We consider the case where the eigenvalue of the limit problem is multiple. We construct the leading…

We study the eigenvalue problem for the Neumann-Laplace operator in conformal regular planar domains $\Omega\subset\mathbb{C}$. Conformal regular domains support the Poincar\'e inequality and this allows us to estimate the variation of the…