Related papers: A note on Spectral Analysis of Quantum graphs
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…
The paper deals with some spectral properties of (mostly infinite) quantum and combinatorial graphs. Quantum graphs have been intensively studied lately due to their numerous applications to mesoscopic physics, nanotechnology, optics, and…
Not necessarily self-adjoint quantum graphs -- differential operators on metric graphs -- are considered. Assume in addition that the underlying metric graph possesses an automorphism (symmetry) $ \mathcal P $. If the differential operator…
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…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
We consider Laplacians on periodic equilateral metric graphs. The spectrum of the Laplacian consists of an absolutely continuous part (which is a union of an infinite number of non-degenerated spectral bands) plus an infinite number of flat…
We study operators on rooted graphs with a certain spherical homogeneity. These graphs are called path commuting and allow for a decomposition of the adjacency matrix and the Laplacian into a direct sum of Jacobi matrices which reflect the…
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…
We present a systematic collection of spectral surgery principles for the Laplacian on a metric graph with any of the usual vertex conditions (natural, Dirichlet or $\delta$-type), which show how various types of changes of a local or…
We study two different types of gluing for graphs: interface (obtained by choosing a common subgraph as the gluing component) and bridge gluing (obtained by adding a set of edges to the given subgraphs). We introduce formulae for computing…
We introduce quantum hypergraphs, in analogy with the theory of quantum graphs developed over the last 15 years by many authors. We emphasize some problems that arise when one tries to define a Laplacian on a hypergraph.
We study the interplay between spectrum, geometry and boundary conditions for two distinguished self-adjoint realisations of the Laplacian on infinite metric graphs, the so-called riedrichs and Neumann extensions. We introduce a new…
In this paper we obtain several tight bounds on different types of alliance numbers of a graph: (global) defensive alliance number, global offensive alliance number and global dual alliance number. In particular, we investigate the…
We introduce a non-backtracking Laplace operator for graphs and we investigate its spectral properties. With the use of both theoretical and computational techniques, we show that the spectrum of this operator captures several structural…
We consider magnetic Schroedinger operators on quantum graphs with identical edges. The spectral problem for the quantum graph is reduced to the discrete magnetic Laplacian on the underlying combinatorial graph and a certain Hill operator.…
We adapt modulus of continuity estimates to the study of spectra of combinatorial graph Laplacians, as well as the Dirichlet spectra of certain weighted Laplacians. The latter case is equivalent to stoquastic Hamiltonians and is of current…
We investigate spectral properties of Kirchhoff Laplacians on radially symmetric antitrees. This class of metric graphs enjoys a rich group of symmetries, which enables us to obtain a decomposition of the corresponding Laplacian into the…
We consider a non self-adjoint Laplacian on a directed graph with non symmetric edge weights. We give necessary conditions for this Laplacian to be sectorial. We introduce a special self-adjoint operator and compare its essential spectrum…
In this paper we propose a spectral flow for graph Laplacians, and prove that it counts the number of nodal domains for a given Laplace eigenvector. This extends work done for Laplacians on $\mathbb{R}^n$ to the graph setting. We mention…
In this article, we relate the spectrum of the discrete magnetic Laplacian (DML) on a finite simple graph with two structural properties of the graph: the existence of a perfect matching and the existence of a Hamiltonian cycle of the…