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

We consider Euler-Bernoulli operators with real coefficients on the unit interval. We prove the following results: i) Ambarzumyan type theorem about the inverse problems for the Euler-Bernoulli operator. ii) The sharp asymptotics of…

For simple connected graphs with incommensurate bond lengths and with unitary symmetry we prove the Bohigas-Giannoni-Schmit conjecture in its most general form. Using supersymmetry and taking the limit of infinite graph size, we show that…

Let $G$ be a graph with adjacency eigenvalues $\lambda_1 \geq \cdots \geq \lambda_n$. Both $\lambda_1 + \lambda_n$ and the odd girth of $G$ can be seen as measures of the bipartiteness of $G$. Csikv\'ari proved in 2022 that for odd girth 5…

We show that there exist pairs of non-isometric potentials for the 1D semiclassical Schr\"odinger operator whose spectra agree up to $O(h^\infty)$, yet their corresponding eigenvalues differ no less than exponentially. This result was…

We consider the class ${\cal A}$ of graphs that contain no odd hole, no antihole, and no "prism" (a graph consisting of two disjoint triangles with three disjoint paths between them). We prove that every graph $G\in{\cal A}$ different from…

A doubly group-labeled graph is an oriented graph with its edges labeled by elements of the direct sum of two groups $\Gamma_1,\Gamma_2$. A cycle in a doubly group-labeled graph is $(\Gamma_1,\Gamma_2)$-non-zero if it is non-zero in both…

A chord of a cycle $C$ is an edge joining two non-consecutive vertices of $C$. A cycle $C$ in a graph $G$ is chorded if the vertex set of $C$ induces at least one chord. In this paper, we prove that if $G$ is a graph with order $n\geq 6$…

In this paper we investigate invertibility of graphs with a unique perfect matching, i.e. graphs having a unique 1-factor. We recall the new notion of the so-called negatively invertible graphs investigated by the authors in the recent…

In this paper, we study commutative zero-divisor semigroups determined by graphs. We prove a uniqueness theorem for a class of graphs. We show two classes of graphs that have no corresponding semigroups. In particular, any complete graph…

A matching $M$ in a graph $G$ is {\em connected} if $G$ has an edge linking each pair of edges in $M$. The problem to find large connected matchings in graphs $G$ with $\alpha(G)=2$ is closely related to Hadwiger's conjecture for graphs…

In this paper the asymmetric generalization of the Glazman-Povzner-Wienholtz theorem is proved for one-dimensional Schr\"{o}dinger operators with strongly singular matrix potentials from the space $H_{loc}^{-1}(\mathbb{R},…

We consider the Schr\"odinger operator with a periodic potential on a quasi 1D continuous periodic model of armchair nanotubes in $\R^3$ in a uniform magnetic field (with amplitude $B\in \R$), which is parallel to the axis of the nanotube.…

We prove Engstr\"{o}m's conjecture that the independence complex of graphs with no induced cycle of length divisible by $3$ is either contractible or homotopy equivalent to a sphere. Our result strengthens a result by Zhang and Wu,…

We consider discrete Schr\"odinger operators with real periodic potentials on periodic graphs. The spectra of the operators consist of a finite number of bands. By "rolling up" a periodic graph along some appropriate directions we obtain…

We study Schr\"odinger operators on the real line whose potentials are generated by an underlying ergodic subshift over a finite alphabet and a rule that replaces symbols by compactly supported potential pieces. We first develop the…

We investigate the limit properties of a family of Schr\"odinger operators of the form $H_\varepsilon= -\frac{\mathrm{d}^2}{\mathrm{d}x^2}+ \frac{\lambda(\varepsilon)}{\varepsilon^2}Q \big(\frac{x}{\varepsilon}\big)$ acting on $n$-edge star…

We put into evidence graphs with adjacency operator whose singular subspace is prescribed by the kernel of an auxiliary operator. In particular, for a family of graphs called admissible, the singular continuous spectrum is absent and there…

The inverse eigenvalue problem of a graph $G$ is the problem of characterizing all lists of eigenvalues of real symmetric matrices whose off-diagonal pattern is prescribed by the adjacencies of $G$. The strong spectral property is a…

Let A be a graph type and B an equivalence relation on a group $G$. Let $[g]$ be the equivalence class of $g$ with respect to the equivalence relation B. The B superA graph of $G$ is an undirected graph whose vertex set is $G$ and two…

Arbitrary operator A on a Banach space X which is the generator of C_0-group with certain growth condition at infinity is considered. The relationship between its exponential type entire vectors and its spectral subspaces is found. Inverse…