Related papers: An Ambarzumian type theorem on graphs with odd cyc…

In a finite-dimensional Euclidian space we consider a connected metric graph with the following property: each two cycles can have at most one common point. Such graphs are called A-graphs. On noncompact A-graph we consider a scattering…

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…

Let $G$ be a finite simple graph with edge ideal $I(G)$. Let $J(G)$ denote the Alexander dual of $I(G)$. We show that a description of all induced cycles of odd length in $G$ is encoded in the associated primes of $J(G)^2$. This result…

Let $G$ be a graph and $A$ be its adjacency matrix. A graph $G$ is invertible if its adjacency matrix $A$ is invertible and the inverse of $G$ is a weighted graph with adjacency matrix $A^{-1}$. A signed graph $(G,\sigma)$ is a weighted…

For the Schr\"odinger equation $-d^2 u/dx^2 + q(x)u = \lambda u$ on a finite $x$-interval, there is defined an "asymmetry function" $a(\lambda;q)$, which is entire of order $1/2$ and type $1$ in $\lambda$. Our main result identifies the…

We investigate spectral properties of quantum graphs in the form of a periodic chain of rings with a connecting link between each adjacent pair, assuming that wave functions at the vertices are matched through conditions manifestly…

An inverse problem is considered for an inhomogeneous Schr\"odinger equation. Assuming that the potential vanishes outside a finite interval and satisfies some other technical assumptions, one proves the uniqueness of the recovery of this…

We prove that any class of graphs with linear neighborhood complexity has bounded improper odd chromatic number. As a result, if $\mathcal{G}$ is the class of all circle graphs, or if $\mathcal{G}$ is any class with bounded twin-width,…

A graph is Berge if it has no induced odd cycle on at least 5 vertices and no complement of induced odd cycle on at least 5 vertices. A graph is perfect if the chromatic number equals the maximum clique number for every induced subgraph.…

We call an oriented odd cycle alternating if it has exactly one vertex whose in-degree and out-degree are both positive. In this paper, we investigate whether certain graphs admit an orientation that avoids alternating odd cycles as…

A Borg-type uniqueness theorem for matrix-valued Schr\"odinger operators is proved. More precisely, assuming a reflectionless potential matrix and spectrum a half-line $[0,\infty)$, we derive triviality of the potential matrix. Our approach…

We introduce the weighted graph Laplacian and the notion of Schr\"odinger operator on a locally finite weighted graph. Concerning essential self-adjointness, we extend Wojciechowski's and Dodziuk's results for graphs with vertex constant…

We consider the Schr\"odinger operator on zigzag graphs with a periodic potential. The spectrum of this operator consists of an absolutely continuous part (intervals separated by gaps) plus an infinite number of eigenvalues with infinite…

Let $\Delta(G)$ be the maximum degree of a graph $G$. Brooks' theorem states that the only connected graphs with chromatic number $\chi(G)=\Delta(G)+1$ are complete graphs and odd cycles. We prove a fractional analogue of Brooks' theorem in…

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 give a necessary and sufficient graph-theoretic characterization of toric ideals of graphs that are unimodular. As a direct consequence, we provide the structure of unimodular graphs by proving that the incidence matrix of a graph $G$ is…

We consider the Neumann Sturm-Liouville problem defined on trees such that the ratios of lengths of edges are not necessarily rational. It is shown that the potential function of the Sturm-Liouville operator must be zero if the spectrum is…

We conjecture that a 2-connected graph $G$ of order $n$, in which $d(x)+d(y)\geq n-k$ for every pair of non-adjacent vertices $x$ and $y$, contains a cycle of length $n-k$ ($k<n/2$), unless $G$ is bipartite and $n-k$ is odd. This…

It is shown that for a given infinite graph $G$ on countably many vertices, and a compact, infinite set of real numbers $\Lambda$ there is a real symmetric matrix $A$ whose graph is $G$ and its spectrum is $\Lambda$. Moreover, the set of…

We consider Schr\"odinger operators with periodic potentials on periodic discrete graphs. The spectrum of the Schr\"odinger operator consists of an absolutely continuous part (a union of a finite number of non-degenerated bands) plus a…