English
Related papers

Related papers: On Pleijel's nodal domain theorem for quantum grap…

200 papers

Let $G$ be a connected graph of order $n$ with domination number $\gamma(G)$. Wang, Yan, Fang, Geng and Tian [Linear Algebra Appl. 607 (2020), 307-318] showed that for any Laplacian eigenvalue $\lambda$ of $G$ with multiplicity…

Combinatorics · Mathematics 2021-09-15 A. Abiad , S. Akbari , M. H. Fakharan , A. Mehdizadeh

We consider families of finite quantum graphs of increasing size and we are interested in how eigenfunctions are distributed over the graph. As a measure for the distribution of an eigenfunction on a graph we introduce the entropy, it has…

Mathematical Physics · Physics 2014-05-23 Lionel Kameni , Roman Schubert

We apply the techniques of our previous paper to study joint eigenfunctions of the Laplacian and one Hecke operator on compact congruence surfaces, and joint eigenfunctions of the two partial Laplacians on compact quotients of…

Dynamical Systems · Mathematics 2010-06-21 Shimon Brooks , Elon Lindenstrauss

On finite metric graphs we consider Laplace operators, subject to various classes of non-self-adjoint boundary conditions imposed at graph vertices. We investigate spectral properties, existence of a Riesz basis of projectors and similarity…

Spectral Theory · Mathematics 2021-03-30 Amru Hussein , David Krejcirik , Petr Siegl

We construct quantum models of two particles on a compact metric graph with singular two-particle interactions. The Hamiltonians are self-adjoint realisations of Laplacians acting on functions defined on pairs of edges in such a way that…

Mathematical Physics · Physics 2015-06-03 Jens Bolte , Joachim Kerner

A metrized graph is a finite weighted graph whose edges are thought of as line segments. In this expository paper, we study the Laplacian operator on a metrized graph and some important functions related to it, including the ``j-function'',…

Combinatorics · Mathematics 2007-05-23 Matthew Baker , Xander Faber

For a compact, connected metric graphs with a boundary that consists of $k$ vertices, we prove that an arbitrary symmetric $k\times k$ matrix with real entries can be realized as the Dirichlet-to-Neumann operator for the Laplacian plus a…

Spectral Theory · Mathematics 2017-12-25 Leonid Friedlander

We develop the theory of torsional rigidity -- a quantity routinely considered for Dirichlet Laplacians on bounded planar domains -- for Laplacians on metric graphs with at least one Dirichlet vertex. Using a variational characterization…

Spectral Theory · Mathematics 2022-11-11 Delio Mugnolo , Marvin Plümer

In this paper, we investigate the eigenvalues of the Laplacian matrix of the "graph of graphs", in which cubic graphs of order n are joined together using Whitehead moves. Our work follows recent results from arXiv:2303.13923 , which…

Combinatorics · Mathematics 2024-05-24 Michael Li

We consider metric graphs with a uniform lower bound on the edge lengths but no further restrictions. We discuss how to describe every local self-adjoint Laplace operator on such graphs by boundary conditions in the vertices given by…

Mathematical Physics · Physics 2018-09-28 Daniel Lenz , Carsten Schubert , Ivan Veselić

According to a well-know theorem by Sturm, a vibrating string is divided into exactly N nodal intervals by zeros of its N-th eigenfunction. Courant showed that one half of Sturm's theorem for the strings applies to the theory of membranes:…

Mathematical Physics · Physics 2011-02-14 Gregory Berkolaiko

We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph . Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…

Spectral Theory · Mathematics 2010-11-25 Nabila Torki-Hamza

In 1956 $\AA$. Pleijel gave his celebrated theorem showing that the inequality in Courant's theorem on the number of nodal domains is strict for large eigenvalues of the Laplacian. This was a consequence of a stronger result giving an…

Spectral Theory · Mathematics 2016-04-29 Philippe Charron , Bernard Helffer , Thomas Hoffmann-Ostenhof

In 2001, Davies, Gladwell, Leydold, and Stadler proved discrete nodal domain theorems for eigenfunctions of generalized Laplacians. In 2019, Jost and Mulas generalized the normalized combinatorial Laplace operator of graphs to signed…

Combinatorics · Mathematics 2022-10-26 Lei Zhang , Yaoping Hou

We derive a number of upper and lower bounds for the first nontrivial eigenvalue of a finite quantum graph in terms of the edge connectivity of the graph, i.e., the minimal number of edges which need to be removed to make the graph…

Spectral Theory · Mathematics 2019-06-04 Gregory Berkolaiko , James B. Kennedy , Pavel Kurasov , Delio Mugnolo

It is proven following [18[ that Laplacians with standard vertex continuous on metric trees and with standard and Dirichlet conditions on arbitrary metric graphs possess an infinite sequence of simple eigenvalues with the eigenfunctions not…

Spectral Theory · Mathematics 2022-01-19 Pavel Kurasov

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…

Spectral Theory · Mathematics 2016-09-26 Sinan Ariturk

We study the nodal set of the Steklov eigenfunctions on the boundary of a smooth bounded domain in $\mathbb{R}^n$ - the eigenfunctions of the Dirichlet-to-Neumann map. Under the assumption that the domain $\Omega$ is $C^2$, we prove a…

Analysis of PDEs · Mathematics 2014-02-19 Katarina Bellova , Fanghua Lin

Let G be a finite connected simple graph. We define the moduli space of conformal structures on G. We propose a definition of conformally covariant operators on graphs, motivated by [25]. We provide examples of conformally covariant…

Combinatorics · Mathematics 2014-10-07 Dmitry Jakobson , Thomas Ng , Matthew Stevenson , Mashbat Suzuki

The nodal domains of eigenvectors of the discrete Schrodinger operator on simple, finite and connected graphs are considered. Courant's well known nodal domain theorem applies in the present case, and sets an upper bound to the number of…

Mathematical Physics · Physics 2013-03-06 Gregory Berkolaiko , Hillel Raz , Uzy Smilansky