Related papers: Comparison of Steklov eigenvalues and Laplacian ei…
We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…
In this paper we study Steklov eigenvalues for the Lam\'e operator which arise in the theory of linear elasticity. In this eigenproblem the spectral parameter appears in a Robin boundary condition, linking the traction and the displacement.…
The rich spectral information of the graph Laplacian has been instrumental in graph theory, machine learning, and graph signal processing for applications such as graph classification, clustering, or eigenmode analysis. Recently, the Hodge…
There is a deep and interesting connection between the topological properties of a graph and the behaviour of the dynamical system defined on it. We analyse various kind of graphs, with different contrasting connectivity or degree…
In this paper, by imposing suitable assumptions on the weighted function, (under the constraint of fixed weighted volume) a Brock-type isoperimetric inequality for Steklov-type eigenvalues of the Witten-Laplacian on bounded domains in a…
On a compact metric graph, we consider the spectrum of the Laplacian defined with a mix of standard and Dirichlet vertex conditions. A Cheeger-type lower bound on the gap $\lambda_2 - \lambda_1$ is established, with a constant that depends…
The standard notion of the Laplacian of a graph is generalized to the setting of a graph with the extra structure of a ``transmission`` system. A transmission system is a mathematical representation of a means of transmitting…
We study the Laplacian on a metrized graph, and its eigenfunctions.
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$.
In this paper we are concerned with various graph invariants (girth, diameter, expansion constants, eigenvalues of the Laplacian, tree number) and their analogs for weighted graphs -- weighing the graph changes a combinatorial problem to…
This paper is devoted to studying impedance eigenvalues (that is, eigenvalues of a particular Dirichlet-to-Neumann map) for the time harmonic linear elastic wave problem, and their potential use as target-signatures for fluid-solid…
In this paper, we establish the relation between classic invariants of graphs and their integer Laplacian eigenvalues, focusing on a subclass of chordal graphs, the strictly chordal graphs, and pointing out how their computation can be…
For a given graph $G$, we aim to determine the possible realizable spectra for a generalized (or sometimes referred to as a weighted) Laplacian matrix associated with $G$. This new specialized inverse eigenvalue problem is considered for…
We extend some classical inequalities between the Dirichlet and Neumann eigenvalues of the Laplacian to the context of mixed Steklov--Dirichlet and Steklov--Neumann eigenvalue problems. The latter one is also known as the sloshing problem,…
Typically, graph structures are represented by one of three different matrices: the adjacency matrix, the unnormalised and the normalised graph Laplacian matrices. The spectral (eigenvalue) properties of these different matrices are…
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…
We estimate the eigenvalues of connection Laplacians in terms of the non-triviality of the holonomy.
Trees can be regarded as discrete analogue of Hadamard manifolds, namely simply-connected Riemannian manifolds of non-positive sectional curvature. In this paper, we compare the first (non-trivial) Steklov eigenvalue and algebraic…
Based on matrix perturbation theory, closed-form analytic expansions are studied for a Laplacian eigenvalue of an undirected, possibly weighted graph, which is close to a unique degree in that graph. An approximation is presented to provide…
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…