Related papers: Inverse eigenvalue problem for discrete Schr\"odin…

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 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…

In this review paper we carry on our investigations on Schroedinger operators with inverse square potentials on the half-line. Depending on several parameters, such operators possess either a finite number of complex eigenvalues, or an…

This article examines the inverse problem for a lossy quantum graph that is internally excited and sensed. In particular, we supply an algorithmic methodology for deducing the topology and geometric structure of the underlying metric graph.…

A discrete eigenvalue E_n of a Schroedinger operator H = -\Delta + vf(r) is given, as a function F_n(v) of the coupling parameter v\ge v_c. It is shown how the potential shape f(x) can be reconstructed from F_n(v). A constructive inversion…

Let $G=(V,E)$ be a finite, simple, connected, combinatorial graph on $n$ vertices and let $D \in \mathbb{R}^{n \times n}$ be its graph distance matrix $D_{ij} = d(v_i, v_j)$. Steinerberger (J. Graph Theory, 2023) empirically observed that…

Assume that the eigenvalues of a finite hermitian linear operator have been deduced accurately but the linear operator itself could not be determined with precision. Given a set of eigenvalues $\lambda$ and a hermitian matrix $M$, this…

In a signed graph $G$, an induced subgraph is called a negative clique if it is a complete graph and all of its edges are negative. In this paper, we give the characteristic polynomials and the eigenvalues of some signed graphs having…

We describe some basic tools in the spectral theory of Schr\"odinger operator on metric graphs (also known as "quantum graph") by studying in detail some basic examples. The exposition is kept as elementary and accessible as possible. In…

Consider the Jacobi operators $\cJ$ given by $(\cJ y)_n=a_ny_{n+1}+b_ny_n+a_{n-1}^*y_{n-1}$, $y_n\in \C^m$ (here $y_0=y_{p+1}=0$), where $b_n=b_n^*$ and $a_n:\det a_n\ne 0$ are the sequences of $m\ts m$ matrices, $n=1,..,p$. We study two…

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 consider an inverse problem for Schr\"odinger operators on a connected equilateral graph $G$ with standard matching conditions. The graph $G$ consists of at least two odd cycles glued together at a common vertex. We prove an Ambarzumian…

We consider the normalized Laplace operator for directed graphs with positive and negative edge weights. This generalization of the normalized Laplace operator for undirected graphs is used to characterize directed acyclic graphs. Moreover,…

We consider a Schr\"odinger operator with complex-valued potentials on the line. The operator has essential spectrum on the half-line plus eigenvalues (counted with algebraic multiplicity) in the complex plane without the positive…

Let $n \geq 4$ be an even integer and $W_n$ be the wheel graph with $n$ vertices. The distance $d_{ij}$ between any two distinct vertices $i$ and $j$ of $W_n$ is the length of the shortest path connecting $i$ and $j$. Let $D$ be the $n…

We establish that the potential appearing in a fractional Schr\"odinger operator is uniquely determined by an internal spectral data.

Let $D$ be an oriented graph. The inversion of a set $X$ of vertices in $D$ consists in reversing the direction of all arcs with both ends in $X$. The inversion number of $D$, denoted by ${\rm inv}(D)$, is the minimum number of inversions…

In this paper, we explore the inverse spectral problem of Sturm-Liouville operator on a star-like graph. To this fixed star-like graph centered at the origin as its vertex, we attach $m$ edges. On each edge, we impose the Sturm-Liouville…

An oscillation formula is established for the $k$-th eigenvector (assumed to be simple and with non-zero entries) of a weighted graph operator. The formula directly attributes the number of sign changes exceeding $k-1$ to the cycles in the…

We consider the self-adjoint Dirac operators on a finite interval with summable matrix-valued potentials and general boundary conditions. For such operators, we study the inverse problem of reconstructing the potential and the boundary…