Related papers: Spectra of infinite graphs via Schur complement
The paper is a continuation of the study started in \cite{Yorzh1}. Schrodinger operators on finite compact metric graphs are considered under the assumption that the matching conditions at the graph vertices are of $\delta$ type. Either an…
We completely determine the spectrum of an $I$-graph, that is, the eigenvalues of its adjacency matrix. We apply our result to prove known characterizations of connectedness and bipartiteness in $I$-graphs by using an spectral approach.…
The arithmetic of N, Z, Q, R can be extended to a graph arithmetic where N is the semiring of finite simple graphs and where Z and Q are integral domains, culminating in a Banach algebra R. A single network completes to the Wiener algebra.…
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…
The spectral theory of quantum graphs is related via an exact trace formula with the spectrum of the lengths of periodic orbits (cycles) on the graphs. The latter is a degenerate spectrum, and understanding its structure (i.e.,finding out…
We construct infinitely many signed graphs having symmetric spectrum, by using the NEPS and rooted product of signed graphs. We also present a method for constructing large cospectral signed graphs. Although the obtained family contains…
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…
In previous works, we constructed UV-finite and unitary scalar field theories with an infinite spectrum of propagating modes for arbitrary polynomial interactions. In this paper, we introduce infinitely many massive vector fields into a…
We present a general method for obtaining the spectra of large graphs with short cycles using ideas from statistical mechanics of disordered systems. This approach leads to an algorithm that determines the spectra of graphs up to a high…
A new algebraic Cayley graph is constructed using finite fields. Its connectedness and diameter bound are studied via Weil's estimate for character sums. These graphs provide a new source of expander graphs, extending classical results of…
Finite graphs that have a common chromatic polynomial have the same number of regular $n$-colorings. A natural question is whether there exists a natural bijection between regular $n$-colorings. We address this question using a functorial…
We study the duals of a certain class of finite-dimensional operator systems, namely the class of operator systems associated to tolerance relations on finite sets or equivalently the class of operator systems that are associated with…
We investigate the bottom of the spectra of infinite quantum graphs, i.e., Laplace operators on metric graphs having infinitely many edges and vertices. We introduce a new definition of the isoperimetric constant for quantum graphs and then…
We study Schr\"odinger operators given by positive quadratic forms on infinite graphs. From there, we develop a criticality theory for Schr\"odinger operators on general weighted graphs.
In this article we study the top of the spectrum of the normalized Laplace operator on infinite graphs. We introduce the dual Cheeger constant and show that it controls the top of the spectrum from above and below in a similar way as the…
A number of results on radial positive definite functions on ${\mathbb R^n}$ related to Schoenberg's integral representation theorem are obtained. They are applied to the study of spectral properties of self-adjoint realizations of two- and…
We calculate the spectrum of the diagram for each finite $3$-transposition group. Such graphs with a given minimal eigenvalue have occurred in the context of compact Griess subalgebras of vertex operator algebras.
We want to introduce a construction of spherical designs from finite graphs with the theory of crystal lattice. We start from a finite graph, and we consider standard realization of the crystal lattices as the maximal Abelian covering of…
We introduce a hypergraph matrix, named the unified matrix, and use it to represent the hypergraph as a graph. We show that the unified matrix of a hypergraph is identical to the adjacency matrix of the associated graph. This enables us to…
A general analytical approach to the statistical description of quantum graph spectra based on the exact periodic orbit expansions of quantum levels is discussed. The exact and approximate expressions obtained in \cite{Anima} for the…