Related papers: Subnormality of unbounded composition operators ov…
A criterion for subnormality of unbounded composition operators in L2-spaces, written in terms of measurable families of probability measures satisfying the so-called consistency condition, is established. It becomes a new characterization…
Fundamental properties of unbounded composition operators in $L^2$-spaces are studied. Characterizations of normal and quasinormal composition operators are provided. Formally normal composition operators are shown to be normal. Composition…
A new method of verifying the subnormality of unbounded Hilbert space operators based on an approximation technique is proposed. Diverse sufficient conditions for subnormality of unbounded weighted shifts on directed trees are established.…
A new method of verifying the subnormality of unbounded Hilbert space operators based on an approximation technique is proposed. Diverse sufficient conditions for subnormality of unbounded weighted shifts on directed trees are established.…
A linear operator $S$ in a complex Hilbert space $\hh$ for which the set $\dzn{S}$ of its $C^\infty$-vectors is dense in $\hh$ and $\{\|S^n f\|^2\}_{n=0}^\infty$ is a Stieltjes moment sequence for every $f \in \dzn{S}$ is said to generate…
The article is devoted to the following question. Consider a periodic self-adjoint difference (differential) operator on a graph (quantum graph) G with a co-compact free action of the integer lattice Z^n. It is known that a local…
In this paper, we study the construction and transformation of two-dimensional persistent graphs. Persistence is a generalization to directed graphs of the undirected notion of rigidity. In the context of moving autonomous agent formations,…
We introduce a new Steiner-type problem for directed graphs named \textsc{$q$-Root Steiner Tree}. Here one is given a directed graph $G=(V,A)$ and two subsets of its vertices, $R$ of size $q$ and $T$, and the task is to find a minimum size…
An oriented graph is a directed graph without directed 2-cycles. Poljak and Turz\'{i}k (1986) proved that every connected oriented graph $G$ on $n$ vertices and $m$ arcs contains an acyclic subgraph with at least $\frac{m}{2}+\frac{n-1}{4}$…
Given an infinite graph $G$ on countably many vertices, and a closed, infinite set $\Lambda$ of real numbers, we prove the existence of an unbounded self-adjoint operator whose graph is $G$ and whose spectrum is $\Lambda$.
A well-established research line in structural and algorithmic graph theory is characterizing graph classes by listing their minimal obstructions. When this list is finite for some class $\mathcal C$ we obtain a polynomial-time algorithm…
We develop two different methods to achieve subexponential time parameterized algorithms for problems on sparse directed graphs. We exemplify our approaches with two well studied problems. For the first problem, {\sc $k$-Leaf…
An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given directed graph D has an out-branching with at least k leaves (Directed…
We prove, by use of inductive techniques, that assorted unbounded composition operators in $L^2$-spaces with matrical symbols are cosubnormal.
The undirected degree/diameter and degree/girth problems and their directed analogues have been studied for many decades in the search for efficient network topologies. Recently such questions have received much attention in the setting of…
It is an intriguing question to see what kind of information on the structure of an oriented graph $D$ one can obtain if $D$ does not contain a fixed oriented graph $H$ as a subgraph. The related question in the unoriented case has been an…
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…
A monotone drawing of a graph G is a straight-line drawing of G such that every pair of vertices is connected by a path that is monotone with respect to some direction. Trees, as a special class of graphs, have been the focus of several…
A locally irregular graph is a graph whose adjacent vertices have distinct degrees, a regular graph is a graph where each vertex has the same degree and a locally regular graph is a graph where for every two adjacent vertices u, v, their…
On finite metric graphs the set of all realizations of the Laplace operator in the edgewise defined $L^2$-spaces are studied. These are defined by coupling boundary conditions at the vertices most of which define non-self-adjoint operators.…