Related papers: Completion problem for extension of m- isometric w…
In this paper we obtain characterizations for adjoint of a composition and weighted composition operator to be composition and weighted composition operator on $F_{\psi}^2,$ respectively. We study the co-isometry composition and weighted…
In this thesis, we establish a necessary and sufficient condition for a weighted composition operator to commute with a self-adjoint weighted composition operator on the Fock space, then obtain a sufficient condition for these commuting…
Partial vertex cover and partial dominating set are two well-investigated optimization problems. While they are $\rm W[1]$-hard on general graphs, they have been shown to be fixed-parameter tractable on many sparse graph classes, including…
In the Maximum Connectivity Improvement (MCI) problem, we are given a directed graph $G=(V,E)$ and an integer $B$ and we are asked to find $B$ new edges to be added to $G$ in order to maximize the number of connected pairs of vertices in…
Bounded and unbounded weighted composition operators on $L^2$ spaces over $\sigma$-finite measure spaces are investigated. A variety of questions related to seminormality of such operators are discussed.
On the basis of the explicit formulae for the action of the unitary group of exponentials corresponding to almost solvable extensions of a given closed symmetric operator with equal deficiency indices, we derive a new representation for the…
We address the question of convergence of Schr\"odinger operators on metric graphs with general self-adjoint vertex conditions as lengths of some of graph's edges shrink to zero. We determine the limiting operator and study convergence in a…
We study $(\alpha,\beta)$-spanners for weighted graphs. We propose a simple greedy completion procedure which starts from a sparse initial graph, and repeatedly fixes pairs of vertices with a bad stretch, generalizing Kunedsen's additive…
We consider the following "multiway cut packing" problem in undirected graphs: we are given a graph G=(V,E) and k commodities, each corresponding to a set of terminals located at different vertices in the graph; our goal is to produce a…
Formal Laplace operators are analyzed for a large class of resistance networks with vertex weights. The graphs are completed with respect to the minimal resistance path metric. Compactness and a novel connectivity hypothesis for the…
Given a finite directed graph, a coloring of its edges turns the graph into a finite-state automaton. A k-synchronizing word of a deterministic automaton is a word in the alphabet of colors at its edges that maps the state set of the…
The task of finding an extension to a given partial drawing of a graph while adhering to constraints on the representation has been extensively studied in the literature, with well-known results providing efficient algorithms for…
In this paper, we introduce a flip operation on self-complementary ideals of chain product posets and study the resulting flip graphs. We give asymptotics for the number of vertices in these graphs, compute their diameters, and give bounds…
The paper focuses on two problems: (i) how to orient the edges of an undirected graph in order to maximize the number of ordered vertex pairs (x,y) such that there is a directed path from x to y, and (ii) how to orient the edges so as to…
The existence of $1$-factorizations of an infinite complete equipartite graph $K_m[n]$ (with $m$ parts of size $n$) admitting a vertex-regular automorphism group $G$ is known only when $n=1$ and $m$ is countable (that is, for countable…
In [36, Section 8], the present author proposed the hypergraph obstruction for the existence of k-regular embeddings. In this paper, we develop the hypergraph obstruction concretely and give some homological obstructions for the k-regular…
A subset $S$ of nodes in a graph $G$ is a $k$-connected $m$-dominating set ($(k,m)$-cds) if the subgraph $G[S]$ induced by $S$ is $k$-connected and every $v \in V \setminus S$ has at least $m$ neighbors in $S$. In the $k$-Connected…
We study weighted composition operators on Hilbert spaces of analytic functions on the unit ball with kernels of the form $(1-<z,w>)^{-\gamma}$ for $\gamma>0$. We find necessary and sufficient conditions for the adjoint of a weighted…
In the context of a weighted graph with vertex set $V$ and bounded vertex degree, we give a sufficient condition for the essential self-adjointness of the operator $\Delta_{\sigma}+W$, where $\Delta_{\sigma}$ is the magnetic Laplacian and…
In a reconfiguration problem, we are given two feasible solutions of a combinatorial problem and our goal is to determine whether it is possible to reconfigure one into the other, with the steps dictated by specific reconfiguration rules.…