Related papers: Quantum graphs and their spectra
We investigate whether it is typical for a sparse graph to be uniquely characterized by its adjacency spectrum up to isomorphism. Our first result shows that the giant component of an Erd\H{o}s-R\'enyi graph is cospectral when the average…
It is well known that the spectral radius of a tree whose maximum degree is $D$ cannot exceed $2\sqrt{D-1}$. In this paper we derive similar bounds for arbitrary planar graphs and for graphs of bounded genus. It is proved that a the…
In this thesis, we analyze the stochastic completeness of a heat kernel on graphs which is a function of three variables: a pair of vertices and a continuous time, for infinite, locally finite, connected graphs. For general graphs, a…
We study the spectral properties of infinite rectangular quantum graphs in the presence of a magnetic field. We study how these properties are affected when three-dimensionality is considered, in particular, the chaological properties. We…
The k-th power of a n-vertex graph X is the iterated cartesian product of X with itself. The k-th symmetric power of X is the quotient graph of certain subgraph of its k-th power by the natural action of the symmetric group. It is natural…
Motivated by the linear time algorithm that locates the eigenvalues of a cograph G [10], we investigate the multiplicity of eigenvalue for \lambda \neq -1,0. For cographs with balanced cotrees we determine explicitly the highest value for…
We study Schr\"odinger operators on an infinite quantum graph of a chain form which consists of identical rings connected at the touching points by $\delta$-couplings with a parameter $\alpha\in\R$. If the graph is "straight", i.e. periodic…
The main result of the article is validity of the limiting absorption principle and thus absence of the singular continuous spectrum for compact quantum graphs with several infinite leads attached. The technique used involves…
This paper generalizes and unifies the existing spectral bounds on the $k$-independence number of a graph, which is the maximum size of a set of vertices at pairwise distance greater than $k$. The previous bounds known in the literature…
Measurement incompatibility--the impossibility of jointly measuring certain quantum observables--is a fundamental resource for quantum information processing. We develop a graph-theoretic framework for quantifying this resource for large…
The spectrum of the Laplace operator in a curved strip of constant width built along an infinite plane curve, subject to three different types of boundary conditions (Dirichlet, Neumann and a combination of these ones, respectively), is…
On compact Riemannian manifolds with a large isometry group we investigate the invariant spectrum of the ordinary Laplacian. For either a toric Kaehler metric, or a rotationally-symmetric metric on the sphere, we produce upper bounds for…
We introduce a curvature function for planar graphs to study the connection between the curvature and the geometric and spectral properties of the graph. We show that non-positive curvature implies that the graph is infinite and locally…
Connectedness and bipartiteness are basic properties of classical graphs, and the purpose of this paper is to investigate the case of quantum graphs. We introduce the notion of connectedness and bipartiteness of quantum graphs in terms of…
A voltage graph is a finite directed graph whose edges are labeled by elements of a finite group $G$. A classical construction of Gross and Tucker associates to every voltage graph with vertex set $V$ a so-called derived graph with vertex…
We give a purely geometric explanation of the coincidence between the Coulomb Branch equations for the 3D GLSM describing the quantum $K$-theory of a flag variety, and the Bethe Ansatz equations of the 5-vertex lattice model. In doing so,…
Let $\mathcal{B}(n,q)$ be the class of block graphs on $n$ vertices having all their blocks of the same size. We prove that if $G\in \mathcal{B}(n,q)$ has at most three pairwise adjacent cut vertices then the minimum spectral radius…
Boundary conditions in quantum graph vertices are generally given in terms of a unitary matrix $U$. Observing that if $U$ has at most two eigenvalues, then the scattering matrix $\mathcal{S}(k)$ of the vertex is a linear combination of the…
We investigate when a complete graph $K_n$ with some edges deleted is determined by its adjacency spectrum. It is shown to be the case if the deleted edges form a matching, a complete graph $K_m$ provided $m \leq n-2$, or a complete…
In this Thesis, we study the behavior of spectral curves of quantum graphs under certain families of vertex conditions, called the $\delta_s$ family, which we define in this work. We focus on studying two main quantities related to the…