Related papers: Recovering quantum graphs from their Bloch spectru…
In this paper we derive novel families of inclusion sets for the spectrum and pseudospectrum of large classes of bounded linear operators, and establish convergence of particular sequences of these inclusion sets to the spectrum or…
The dual of a polyhedron is a polyhedron -- or in graph theoretical terms: the dual of a 3-connected plane graph is a 3-connected plane graph. Astonishingly, except for sufficiently large facewidth, not much is known about the connectivity…
We show that flat bands can be categorized into two distinct classes, that is, singular and nonsingular flat bands, by exploiting the singular behavior of their Bloch wave functions in momentum space. In the case of a singular flat band,…
We investigate the relation between the symmetries of a Schr\"odinger operator and the related topological quantum numbers. We show that, under suitable assumptions on the symmetry algebra, a generalization of the Bloch-Floquet transform…
We consider the Dirac equation on periodic networks (quantum graphs). The self-adjoint quasi periodic boundary conditions are derived. The secular equation allowing us to find the energy spectrum of the Dirac particles on periodic quantum…
It is shown that although the spectrum of the analytic generator of a one--parameter group of isometries of a Banach space may be equal to the whole complex plane, a simple operation of ampliating the analytic generator onto its graph…
Let $G$ be a graph with $n$ vertices, and let $A(G)$ and $D(G)$ denote respectively the adjacency matrix and the degree matrix of $G$. Define $$ A_{\alpha}(G)=\alpha D(G)+(1-\alpha)A(G) $$ for any real $\alpha\in [0,1]$. The collection of…
The SO(3) Kauffman polynomial and the chromatic polynomial of planar graphs are categorified by a unique extension of the Khovanov homology framework. Many structural observations and computations of homologies of knots and spin networks…
We investigate the spectral function of Bloch states in an one-dimensional tight-binding non-interacting chain with two different models of static correlated disorder, at zero temperature. We report numerical calculations of the…
We develop a full characterization of abelian quantum statistics on graphs. We explain how the number of anyon phases is related to connectivity. For 2-connected graphs the independence of quantum statistics with respect to the number of…
We compute the spectrum for a class of quantum Markov semigroups describing systems of $N$ particle interacting through a binary collision mechanism. These quantum Markov semgroups are associated to a novel kind of quantum random walk on…
Integral Apollonian packing, the packing of circles with integer curvatures, where every circle is tangent to three other mutually tangent circles, is shown to encode the fractal structure of the energy spectrum of two-dimensional Bloch…
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…
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 consider Schr\"odinger operators with periodic potentials on periodic discrete graphs. Their spectrum consists of a finite number of bands. We obtain two-sided estimates of the total bandwidth for the Schr\"odinger operators in terms of…
We provide a criterion to distinguish two graphs which are indistinguishable by $2$-dimensional Weisfeiler-Lehman algorithm for almost all graphs. Haemers conjectured that almost all graphs are identified by their spectrum. Our approach…
Non-Hermitian systems exhibit diverse graph patterns of energy spectra under open boundary conditions. Here we present an algebraic framework to comprehensively characterize the spectral geometry and graph topology of non-Bloch bands. Using…
While the Bloch spectrum of translationally invariant noninteracting lattice models is trivially obtained by a Fourier transformation, diagonalizing the same problem in the presence of open boundary conditions is typically only possible…
A connected graph is called a block graph if each of its blocks is a complete graph. Let $\mathbf{Bl}(\textbf{k}, \varphi)$ be the class of block graphs on $\textbf{k}$ vertices with given dissociation number $\varphi$. In this article, we…
We characterize the graphs with loops whose degree sequences have no repeated values and find their adjacency spectrum. In the case of simple graphs, such graphs are called anti-regular graphs and are examples of threshold graphs. The…