Related papers: Spectra of infinite graphs: two methods of computa…
We present a spectral method for one-sided linear fractional integral equations on a closed interval that achieves exponentially fast convergence for a variety of equations, including ones with irrational order, multiple fractional orders,…
This introduction to graphs and graph algebras provides the optimal bound for the number of all paths of length $k$ in a graph with $N\geq k$ edges and no loops. Our proof relies on a construction of a number of terminating algorithms that…
Motivated in part by combinatorial applications to certain sum-product phenomena, we introduce unimodular graphs over finite fields and, more generally, over finite valuation rings. We compute the spectrum of the unimodular graphs, by using…
Introduced the quantitative measure of the structural complexity of the graph (complex network, etc.) based on a procedure similar to the renormalization process, considering the difference between actual and averaged graph structures on…
The search for a highly discriminating and easily computable invariant to distinguish graphs remains a challenging research topic. Here we focus on cospectral graphs whose complements are also cospectral (generalized cospectral), and on…
Via the process of isospectral graph reduction the adjacency matrix of a graph can be reduced to a smaller matrix while its spectrum is preserved up to some known set. It is then possible to estimate the spectrum of the original matrix by…
We consider the 1D periodic Jacobi matrices. The spectrum of this operator is purely absolutely continuous and consists of intervals separated by gaps. We solve the inverse problem (including characterization) in terms of vertical slits on…
We study some versions of the statement of Hadwiger's conjecture for finite as well as infinite graphs.
We investigate spectral quantities of quantum graphs by expanding them as sums over pseudo orbits, sets of periodic orbits. Only a finite collection of pseudo orbits which are irreducible and where the total number of bonds is less than or…
The spectral density of random graphs with topological constraints is analysed using the replica method. We consider graph ensembles featuring generalised degree-degree correlations, as well as those with a community structure. In each case…
We consider quantum walks on a finite graphs to which infinite tails are attached. We explore how the propagating and bound states depend on the structure of the finite graph. The S-matrix for such graphs is defined. Its unitarity is proved…
The spectrum of a semi-infinite quantum graph tube with square period cells is analyzed. The structure is obtained by rolling up a doubly periodic quantum graph into a tube along a period vector and then retaining only a semi-infinite half…
Spectral measures arise in numerous applications such as quantum mechanics, signal processing, resonances, and fluid stability. Similarly, spectral decompositions (pure point, absolutely continuous and singular continuous) often…
We consider two notions describing how one finite graph may be larger than another. Using them, we prove several theorems for such pairs that compare the number of spanning trees, the return probabilities of random walks, and the number of…
We characterize all bounded Hankel operators $\Gamma $ such that $\Gamma^*\Gamma$ has finite spectrum. We identify spectral data corresponding to such operators and construct inverse spectral theory including the characterization of these…
In this note we elaborate on some notions of surface area for discrete graphs which are closely related to the inverse degree. These notions then naturally lead to associated connectivity measures of graphs and to the definition of a…
In this paper we establish spectral comparison results for Schr\"odinger operators on a certain class of infinite quantum graphs, using recent results obtained in the finite setting. We also show that new features do appear on infinite…
We extend the concept of the law of a finite graph to graphings, which are, in general, infinite graphs whose vertices are equipped with the structure of a probability space. By doing this, we obtain a vast array of new unimodular measures.…
We put forward the concept of measure graphs. These are (possibly uncountable) graphs equipped with an action of a groupoid and a measure invariant under this action. Examples include finite graphs, periodic graphs, graphings and…
Spectral graph bisections are a popular heuristic aimed at approximating the solution of the NP-complete graph bisection problem. This technique, however, does not always provide a robust tool for graph partitioning. Using a special class…