Related papers: Surgery principles for the spectral analysis of qu…
We extend the surgical tool box for quantum graphs to anti-standard and $\delta'$ vertex conditions. Monotonicity properties of eigenvalues of graph Laplacian with $\delta'$ interactions at vertices depend on the sign of vertex parameter.…
We introduce $\delta$ type vertex conditions for beam operators, the fourth derivative operator, on metric graphs and study the effect of certain geometrical alterations (graph surgery) of the graph on the spectra of beam operators on…
We consider the problem of finding universal bounds of "isoperimetric" or "isodiametric" type on the spectral gap of the Laplacian on a metric graph with natural boundary conditions at the vertices, in terms of various analytical and…
We develop eigenvalue estimates for the Laplacians on discrete and metric graphs using different types of boundary conditions at the vertices of the metric graph. Via an explicit correspondence of the equilateral metric and discrete graph…
Quantum graphs have attracted attention from mathematicians for some time. A quantum graph is defined by having a Laplacian on each edge of a metric graph and imposing boundary conditions at the vertices to get an eigenvalue problem. A…
The spectrum of the normalized graph Laplacian yields a very comprehensive set of invariants of a graph. In order to understand the information contained in those invariants better, we systematically investigate the behavior of this…
On a finite connected metric graph, we establish upper bounds for the eigenvalues of the Laplacian. These bounds depend on the length, the Betti number, and the number of pendant vertices. For trees, these estimates are sharp. We also…
The aim of the present article is to give an overview of spectral theory on metric graphs guided by spectral geometry on discrete graphs and manifolds. We present the basic concept of metric graphs and natural Laplacians acting on it and…
The Laplacian eigenvalues of a network play an important role in the analysis of many structural and dynamical network problems. In this paper, we study the relationship between the eigenvalue spectrum of the normalized Laplacian matrix and…
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.…
In this paper we give a method to geometrically modify an open set such that the first $k$ eigenvalues of the Dirichlet Laplacian and its perimeter are not increasing, its measure remains constant, and both perimeter and diameter decrease…
The purpose of this paper is to explore the asymptotics of the eigenvalue spectrum of the Laplacian on 2 dimensional spaces of constant curvature, giving strong experimental evidence for a conjecture of the second author…
We study the location of the spectrum of the Laplacian on compact metric graphs with complex Robin-type vertex conditions, also known as $\delta$ conditions, on some or all of the graph vertices. We classify the eigenvalue asymptotics as…
We present the spectrum of the (normalized) graph Laplacian as a systematic tool for the investigation of networks, and we describe basic properties of eigenvalues and eigenfunctions. Processes of graph formation like motif joining or…
Many variants of join operations of graphs have been introduced and their spectral properties have been studied extensively by many researchers. This paper mainly focuses on the Laplacian spectra of some double join operations of graphs. We…
Laplacian operators on finite compact metric graphs are considered under the assumption that matching conditions at graph vertices are of $\delta$ and $\delta'$ types. An infinite series of trace formulae is obtained which link together two…
A finite discrete graph is turned into a quantum (metric) graph once a finite length is assigned to each edge and the one-dimensional Laplacian is taken to be the operator. We study the dependence of the spectral gap (the first positive…
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…
We derive several upper bounds on the spectral gap of the Laplacian with standard or Dirichlet vertex conditions on compact metric graphs. In particular, we obtain estimates based on the length of a shortest cycle (girth), diameter, total…
We prove interlacing inequalities between spectral minimal energies of metric graphs built on Dirichlet and standard Laplacian eigenvalues, as recently introduced in [Kennedy et al, arXiv:2005.01126]. These inequalities, which involve the…