It is necessary to generate the automorphism group of a chemical graph in computer-aided structure elucidation. An Euclidean graph associated with a molecule is defined by a weighted graph with adjacency matrix M = [dij], where for i≠j, dij is the Euclidean distance between the nuclei i and j. In this matrix dii can be taken as zero if all the nuclei are equivalent. Otherwise, one may introduce...

in this paper, we use the concept of graph convergence of h(.,.)-co-accretive mapping introduced by [r. ahmad, m. akram, m. dilshad, graph convergence for the h(.,.)-co-accretive mapping with an application, bull. malays. math. sci. soc., doi: 10.1007/s40840-014-0103-z, 2014$] and define an over-relaxed proximal point method to obtain the solution of a generalized variational inclusion problem ...

Shadow banking is a term that came out of the financial crisis of 2007-2009. There is a belief that shadow banking was one of the crisis reasons. Because the excessive expansion of shadow banking endangers the financial stability of countries, this paper examines the impact of shadow banking on financial stability using data from 14 countries of the G20 during 2002-2018. We divided countries in...

This paper presents an efficient approach for moving objects detection and shadow removal from color videos obtained using stationary camera. A background subtraction technique based on modified adaptive GMM has been proposed for detecting moving objects. Speed-up techniques have also been applied to enhance the computational efficiency of the algorithm. Then, a robust algorithm for shadow remo...

In this paper we solve three equivalent problems. The first is: what $3$-uniform hypergraph on a ground set of size $n$, having at least $e$ edges, has the most $2$-independent sets? Here is subset vertices containing fewer than $2$ from each edge. This to problem determining for which $\partial^+(\partial_2(\mathcal{H}))$ minimized. $\partial_2({\cdot})$ down-shadow level $2$, and $\partial^+(...

The shadow minimization problem for t-intersecting systems of finite sets is considered. Let A be a family of k-subsets of N. The -shadow of A is the set of all (k− )-subsets ∂ A contained in the members of A. Let A be a t-intersecting family (any two members have at least t elements in common) with |A| =m. Given k,t,m the problem is to minimize |∂ A| (over all choices of A). In this paper we s...

a 1993 result of j. llibre, and m. misiurewicz, (theorem a [5]), states that if a continuous map f of a graph into itself has an s-horseshoe, then the topological entropy of f is greater than or equal to logs, that is h( f ) ? logs. also a 1980 result of l.s. block, j. guckenheimer, m. misiurewicz and l.s. young (lemma 1.5 [3]) states that if g is an a-graph of f then h(g) ? h( f ). in this pap...

It is well known that the G(n, p) model of random graphs undergoes a dramatic change around p = 1 n . It is here that the random graph, almost surely, contains cycles, and here it first acquires a giant (i.e., order Ω(n)) connected component. Several years ago, Linial and Meshulam introduced the Yd(n, p) model, a probability space of n-vertex d-dimensional simplicial complexes, where Y1(n, p) c...

In this paper we show that the multicast problem in trees can be expressed in term of arranging rows and columns of boolean matrices Given a p q matrix M with entries the shadow of M is de ned as a boolean vector x of q entries such that xi if and only if there is no entry in the ith column of M and xi otherwise The shadow x can also be seen as the binary expression of the integer x Pq i xi q i...