Related papers: Can One Hear the Shape of a Graph?
The complexity of the matching polytope of graphs may be measured with the maximum length $\beta$ of a starting sequence of odd ears in an ear-decomposition. Indeed, a theorem of Edmonds and Pulleyblank shows that its facets are defined by…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
Let $G$ be a finite graph and $\kappa(G)$ the vertex connectivity of $G$. A chordal graph $G$ is called chordal$^*$ if no vertex of $G$ is adjacent to all other vertices of $G$. Using the syzygy theory in commutative algebra, it is proved…
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.…
Spectral analysis is performed on the Born equation, a strongly singular integral equation modeling the interactions between electromagnetic waves and arbitrarily shaped dielectric scatterers. Compact and Hilbert--Schmidt operator…
We count invertible Schr\"odinger operators (perturbations by diagonal matrices of the adjacency matrix) over finite fieldsfor trees, cycles and complete graphs.This is achieved for trees through the definition and use of local invariants…
The metric dimension of non-component graph, associated to a finite vector space, is determined. It is proved that the exchange property holds for resolving sets of the graph, except a special case. Some results are also related to an…
A spectral mapping theorem is proved that resolves a key problem in applying invariant manifold theorems to nonlinear Schr\" odinger type equations. The theorem is applied to the operator that arises as the linearization of the equation…
Mesoscopic systems and large molecules are often modeled by graphs of one-dimensional wires, connected at vertices. In this paper we discuss the solutions of the Schr\"odinger equation on such graphs, which have been named "quantum…
We consider the Schr\"odinger operator in the plane with delta-potential supported by a curve. For the cases of an infinite curve and a finite loop we give estimates on the lower bound of the spectrum expressed explicitly through the…
We show that resonant frequencies of a system of coupled resonators in a truncated periodic lattice converge to the essential spectrum of corresponding infinite lattice. We use the capacitance matrix as a model for fully coupled resonators…
We use the line digraph construction to associate an orthogonal matrix with each graph. From this orthogonal matrix, we derive two further matrices. The spectrum of each of these three matrices is considered as a graph invariant. For the…
We study Schr\"odinger operators on compact finite metric graphs subject to $\delta$-coupling and standard boundary conditions. We compare the $n$-th eigenvalues of those self-adjoint realizations and derive an asymptotic result for the…
We show that an arbitrary infinite graph can be compactified by its ${\aleph_0}$-tangles in much the same way as the ends of a locally finite graph compactify it in its Freudenthal compactification. In general, the ends then appear as a…
The spectra of the Schr\"odinger operators with periodic potentials are studied. When the potential is real and periodic, the spectrum consists of at most countably many line segments (energy bands) on the real line, while when the…
Complex systems of interacting components often can be modeled by a simple graph $\mathcal{G}$ that consists of a set of $n$ nodes and a set of $m$ edges. Such a graph can be represented by an adjacency matrix $A\in\R^{n\times n}$, whose…
We consider the problem of constructing a Shape Expression Schema (ShEx) that describes the structure of a given input RDF graph. We employ the framework of grammatical inference, where the objective is to find an inference algorithm that…
We study the graphs formed from instances of the stable matching problem by connecting pairs of elements with an edge when there exists a stable matching in which they are matched. Our results include the NP-completeness of recognizing…
In this article we continue our analysis of Schr\"odinger operators on arbitrary graphs given as certain Laplace operators. In the present paper we give the proof of the composition rule for the scattering matrices. This composition rule…
We present a graph model for a background independent, relational approach to spacetime emergence. The general idea and the graph main features, detailed in [1], are discussed. This is a combinatorial (dynamical) metric graph, colored on…