Related papers: Levinson's theorem for graphs II
Consider the graph that has as vertices all bitstrings of length $2n+1$ with exactly $n$ or $n+1$ entries equal to 1, and an edge between any two bitstrings that differ in exactly one bit. The well-known middle levels conjecture asserts…
In this paper we explore some results concerning the spread of the line and the total graph of a given graph. In particular, it is proved that for an $(n,m)$ connected graph $G$ with $m > n \geq 4$ the spread of $G$ is less than or equal to…
We consider in this paper space-cutoff charged $P(\varphi)_{2}$ models arising from the quantization of the non-linear charged Klein-Gordon equation: \[ (\p_{t}+\i V(x))^{2}\phi(t, x)+ (-\Delta_{x}+ m^{2})\phi(t,x)+…
We prove that, in the Gilbert model for a random geometric graph, almost every graph becomes Hamiltonian exactly when it first becomes 2-connected. This answers a question of Penrose. We also show that in the k-nearest neighbor model, there…
We prove some results concerning Alcuin number of graphs. First, we classify graphs which have unique minimum vertex cover. Then we present two necessary conditions for a graph to be of class two and show why one of them (condition on…
This paper presents sufficient conditions for Hamiltonian paths and cycles in graphs. Letting $\lambda\left( G\right) $ denote the spectral radius of the adjacency matrix of a graph $G,$ the main results of the paper are: (1) Let $k\geq1,$…
We consider a charged particle following the boundary of a two-dimensional domain because a homogeneous magnetic field is applied. We develop the basic scattering theory for the corresponding quantum mechanical edge states. The scattering…
We connect quantum compact graphs with infinite leads, and turn them into scattering systems. We derive an exact expression for the scattering matrix, and explain how it is related to the spectrum of the corresponding closed graph. The…
We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of…
In this review paper we carry on our investigations on Schroedinger operators with inverse square potentials on the half-line. Depending on several parameters, such operators possess either a finite number of complex eigenvalues, or an…
The speed of a class of graphs counts the number of graphs on the vertex set $\lbrace 1,\dots, n\rbrace$ inside the class as a function of $n$. In this paper, we investigate this function for many classes of graphs that naturally arise in…
This work develops a flexible and mathematically sound framework for the design and analysis of graph scattering networks with variable branching ratios and generic functional calculus filters. Spectrally-agnostic stability guarantees for…
We present a direct and simple method for the computation of the total scattering matrix of an arbitrary finite noncompact connected quantum graph given its metric structure and local scattering data at each vertex. The method is inspired…
In the model suggested by Smilansky one studies an operator describing the interaction between a quantum graph and a system of $K$ one-dimensional oscillators attached at several different points in the graph. The present paper is the first…
An $n$-vertex graph is Hamiltonian if it contains a cycle that covers all of its vertices and it is pancyclic if it contains cycles of all lengths from $3$ up to $n$. A celebrated meta-conjecture of Bondy states that every non-trivial…
A weighted graph $G$ with countable vertex set is bounded if there is an upper bound on the maximum of the sum of absolute values of all edge weights incident to a vertex in $G$. In this paper, we prove a fundamental result on equitable…
We realise the number of bound states of a Schr\"{o}dinger operator on $\mathbb{R}^n$ as an index pairing in all dimensions. Expanding on ideas of Guillop\'{e} and others, we use high-energy corrections to find representatives of the…
We study scattering processes on $p$-adic multiloop surfaces represented as multiloop infinite graphs with total valence in each vertex equal $p+1$. They all are spaces of the constant negative curvature since they are quotients of the…
An asymptotic analysis for a system with equation and dynamic boundary condition of Cahn-Hilliard type is carried out as the coefficient of the surface diffusion acting on the phase variable tends to 0, thus obtaining a forward-backward…
The problem of packing Hamilton cycles in random and pseudorandom graphs has been studied extensively. In this paper, we look at the dual question of covering all edges of a graph by Hamilton cycles and prove that if a graph with maximum…