Related papers: The inverse nullity pair problem and the strong nu…
Spectral hypergraph theory has recently attracted considerable interest as it provides a natural framework for modeling higher-order relationships beyond classical graphs. In this setting, eigenvalues of adjacency, Laplacian, and…
We consider the inverse dynamic problem for the wave equation with a potential on a real line. The forward initial-boundary value problem is set up with a help of boundary triplets. As an inverse data we use an analog of a response operator…
Spectral graph theory is a captivating area of graph theory that employs the eigenvalues and eigenvectors of matrices associated with graphs to study them. In this paper, we present a collection of $20$ topics in spectral graph theory,…
A graph is called integral if all eigenvalues of its adjacency matrix consist entirely of integers. We prove that for a given nullity more than 1, there are only finitely many integral trees. It is also shown that integral trees with…
We revisit the relative perturbation theory for invariant subspaces of positive definite matrix pairs. As a prototype model problem for our results we consider parameter dependent families of eigenvalue problems. We show that new estimates…
We present a real symmetric tri-diagonal matrix of order $n$ whose eigenvalues are $\{2k \}_{k=0}^{n-1}$ which also satisfies the additional condition that its leading principle submatrix has a uniformly interlaced spectrum, $\{2l + 1…
Graph is an abstract representation commonly used to model networked systems and structure. In problems across various fields, including computer vision and pattern recognition, and neuroscience, graphs are often brought into comparison (a…
Inverse eigenvalue and singular value problems have been widely discussed for decades. The well-known result is the Weyl-Horn condition, which presents the relations between the eigenvalues and singular values of an arbitrary matrix. This…
Given a graph $G$, one may ask: "What sets of eigenvalues are possible over all weighted adjacency matrices of $G$?" (The weight of an edge is positive or negative, while the diagonal entries can be any real numbers.) This is known as the…
We consider the class of bounded symmetric Jacobi matrices $J$ with positive off-diagonal elements and complex diagonal elements. With each matrix $J$ from this class, we associate the spectral data, which consists of a pair $(\nu,\psi)$.…
An new eigenvalue $\mathbb R$-linear problem arisen in the theory of metamaterials is stated and constructively investigated for circular non-overlapping inclusions. An asymptotic formula for eigenvalues is deduced when the radii of…
We investigate the spectrum of the non-backtracking matrix of a graph. In particular, we show how to obtain eigenvectors of the non-backtracking matrix in terms of eigenvectors of a smaller matrix. Furthermore, we find an expression for the…
In this paper, we consider the inverse eigenvalue problem for the positive doubly stochastic matrices, which aims to construct a positive doubly stochastic matrix from the prescribed realizable spectral data. By using the real Schur…
In the present paper, we examine Ising systems on d-dimensional hypercube lattices and solve an inverse problem where we have to determine interaction constants of an Ising connection matrix when we know a spectrum of it eigenvalues. In…
A general treatment of the spectral problem of quantum graphs and tight-binding models in finite Hilbert spaces is given. The direct spectral problem and the inverse spectral problem are written in terms of simple algebraic equations…
During routine state space circuit analysis of an arbitrarily connected set of nodes representing a lossless LC network, a matrix was formed that was observed to implicitly capture connectivity of the nodes in a graph similar to the…
A positive function (conductivity) on the edges of a graph induces the Dirichlet-to- Neumann map between boundary values of harmonic functions. The inverse conductivity problem is to find the conductivity from the Dirichlet-to-Neumann map.…
When a randomness is introduced at the level of real matrix elements, depending on its particular realization, a pair of eigenvalues can appear as real or form a complex conjugate pair. We show that in the limit of large matrix size the…
The inverse problem of spectral analysis for the non-self-adjoint matrix Sturm-Liouville operator on a finite interval is investigated. We study properties of the spectral characteristics for the considered operator, and provide necessary…
Twin vertices of a graph have the same open neighbourhood. If they are not adjacent, then they are called duplicates and contribute the eigenvalue zero to the adjacency matrix. Otherwise they are termed co-duplicates, when they contribute…