A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

        The Rivest–Shamir–Adleman (RSA) and the Diffie-Hellman (DH) key exchange are famous methods for encryption. These methods  depended on selecting the primes p and q in order  to be secure enough . This paper shows that the named methods used the primes which are found by some arithmetical function .In the other sense, no need to think about getting primes p and q and how they are secure enough, since the arithmetical function enable to build the primes in such complicated way to be secure. Moreover, this article   gives  new construction  of the  RSA  algorithm and DH key  exchange using the

primes p,qfrom areal number x.

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

    It is so much noticeable that initialization of architectural parameters has a great impact on whole learnability stream so that knowing  mathematical properties of dataset results in providing neural network architecture a better expressivity and capacity. In this paper, five random samples of the Volve field dataset were taken. Then a training set was specified and the persistent homology of the dataset was calculated to show impact of data complexity on selection of multilayer perceptron regressor (MLPR) architecture. By using the proposed method that provides a well-rounded strategy to compute data complexity. Our method is a compound algorithm composed of the t-SNE method, alpha-complexity algorithm, and a persistence barcod

In this paper we introduce and study the concepts of semisimple gamma modules , regular gamma modules and fully idempotent gamma modules as a generalization of semisimple ring. An module is called fully idempotent (semisimple , regular) if for all submodule of (every submodule is a direct summand, for each , there exists and such that . We study some properties and relationships between them.

In this paper, we introduce and study a new concept (up to our knowledge) named CL-duo modules, which is bigger than that of duo modules, and smaller than weak duo module which is given by Ozcan and Harmanci. Several properties are investigated. Also we consider some characterizations of CL-duo modules. Moreover, many relationships are given for this class of modules with other related classes of modules such as weak duo modules, P-duo modules.

The traveling salesman problem (TSP) is a well-known and important combinatorial optimization problem. The goal is to find the shortest tour that visits each city in a given list exactly once and then returns to the starting city. In this paper we exploit the TSP to evaluate the minimum total cost (distance or time) for Iraqi cities. So two main methods are investigated to solve this problem; these methods are; Dynamic Programming (DP) and Branch and Bound Technique (BABT). For the BABT, more than one lower and upper bounds are be derived to gain the best one. The results of BABT are completely identical to DP, with less time for number of cities (n), 5 ≤ n ≤ 25. These results proof the efficiency of BABT compared with so

Throughout this paper R represents commutative ring with identity, and M is a unitary left R-module. The purpose of this paper is to study a new concept, (up to our knowledge), named a semi-extending modules, as generalization of extending modules, where an Rmodule M is called semi-extending if every sub module of M is a semi-essential in a direct summand of M. Various properties of semi-extending module are considered. Moreover, we investigate the relationships between semi-extending modules and other related concepts, such as CLS-modules and FI- extending modules.

In this work we study gamma modules which are implying full stability or implying by full stability. A gamma module is fully stable if for each gamma submodule of and each homomorphism of into . Many properties and characterizations of these classes of gamma modules are considered. We extend some results from the module to the gamma module theories.