Related papers: A Structured Inverse Spectrum Problem for Infinite…

Given two possibly unbounded selfadjoint operators A and G such that the resolvent sets of AG and GA are non-empty, it is shown that the operator AG has a spectral function on IR with singularities if there exists a non-zero polynomial p…

The inverse eigenvalue problem of a graph $G$ aims to find all possible spectra for matrices whose $(i,j)$-entry, for $i\neq j$, is nonzero precisely when $i$ is adjacent to $j$. In this work, the inverse eigenvalue problem is completely…

We study the spectrum of a periodic self-adjoint operator on the axis perturbed by a small localized nonself-adjoint operator. It is shown that the continuous spectrum is independent of the perturbation, the residual spectrum is empty, and…

In this paper, we shall consider the notion of bicomplex inner product and define bicomplex Hilbert space. We shall define $L^{2}[a,b]$ where the functions take bicomplex values. We shall prove the Theorem for a bounded self adjoint…

In this paper, we introduce the B-discrete spectrum of an unbounded closed operator and we prove that a closed operator has a purely B-discrete spectrum if and only if it has a meromorphic resolvent. After that, we study the stability of…

We examine the Maximum Independent Set Problem in an undirected graph. The main result is that this problem can be considered as the solving the same problem in a subclass of the weighted normal twin-orthogonal graphs. The problem is…

Counting independent sets in graphs and hypergraphs under a variety of restrictions is a classical question with a long history. It is the subject of the celebrated container method which found numerous spectacular applications over the…

Given a locally finite simple graph so that its degree is not bounded, every self-adjoint realization of the adjacency matrix is unbounded from above. In this note we give an optimal condition to ensure it is also unbounded from below. We…

A graph $G$ is said to be $\preceq$-ubiquitous, where $\preceq$ is the minor relation between graphs, if whenever $\Gamma$ is a graph with $nG \preceq \Gamma$ for all $n \in \mathbb{N}$, then one also has $\aleph_0 G \preceq \Gamma$, where…

We generalize the notion of Lagrangian subspaces to self-orthogonal subspaces with respect to a (skew-)symmetric form, thus characterizing (skew-)self-adjoint and unitary operators by means of self-ortho-gonal subspaces. By orthogonality…

In this work, we study the inverse spectral problem, using the Weyl matrix as the input data, for the matrix Schrodinger operator on the half-line with the boundary condition being the form of the most general self-adjoint. We prove the…

We prove that every graph $G$ on $n$ vertices with no isolated vertices contains an induced subgraph of size at least $n/10000$ with all degrees odd. This solves an old and well-known conjecture in graph theory.

In this paper, we consider self-adjoint difference equations of the form -\Delta(a_{n-1}\Delta y_{n-1})+b_{n}y_{n}=\lambda y_{n},n=0,1,...\label{eq:abstract} where $a_{n-1}>0$ for all $n\ge0$ and $b_{n}$ are real and $\lambda$ is complex.…

For an unbounded operator $S$ on a Banach space the existence of invariant subspaces corresponding to its spectrum in the left and right half-plane is proved. The general assumption on $S$ is the uniform boundedness of the resolvent along…

A hollow matrix described by a graph $G$ is a real symmetric matrix having all diagonal entries equal to zero and with the off-diagonal entries governed by the adjacencies in $G$. For a given graph $G$, the determination of all possible…

A finite dimensional operator that commutes with some symmetry group admits quotient operators, which are determined by the choice of associated representation. Taking the quotient isolates the part of the spectrum supporting the chosen…

For any graph $G$ on $n$ vertices and for any {\em symmetric} subgraph $J$ of $K_{n,n}$, we construct an infinite sequence of graphs based on the pair $(G,J)$. The First graph in the sequence is $G$, then at each stage replacing every…

The {\em distinguishing number} of a group $G$ acting faithfully on a set $V$ is the least number of colors needed to color the elements of $V$ so that no non-identity element of the group preserves the coloring. The {\em distinguishing…

We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of…

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