Let $G=(V,E)$ be a simple connected graph. A perfect matching (or Kekul'e structure in chemical literature) of $G$ is a set of disjoint edges which covers all vertices of $G$. The anti-forcing number of $G$ is the smallest number of edges such that the remaining graph obtained by deleting these edges has a unique perfect matching and is denoted by $af(G)$. In this paper we consider some specifi...

In this paper, we develop two approaches to investigation of inverse spectral problems for a new class nonlocal operators on metric graphs. The Laplace differential operator is considered star-shaped graph with integral matching condition. This adjoint the functional-differential frozen argument at central vertex graph. We study problem that consists in recovery condition coefficients from eige...

Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...

This paper presents and solves in polynomial time the dynamic matching problem, an integer programming problem which involves matchings in a time-expanded infinite network. The initial model is a finite directed graph G = (V, E) in which each edge has an associated real-valued weight and an integral distance. We wish to "match" vertices over an infinite horizon, and we permit vertex i in period...

In the security video surveillance system, image splicing technology faces difficulty of achieving large parallax and small overlap area. This paper summarizes traditional stitching analyzes that matching algorithm is key to solve problem stitching. Aiming at problems methods with low accuracy cannot adapt non-rigid transformatio, a model based on proposed in this for tasks. The which combines ...