The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

Truncated distributions arise naturally in many practical situations. It’s a conditional distribution that develops when the parent distribution's domain is constrained to a smaller area. The distribution of a right truncated is one of the types of a single truncated that is restricted within a specific field and usually occurs when the specified period for the study is complete.  Hence, this paper introduces Right Truncated Inverse Generalized Rayleigh Distribution (RTIGRD) with two parameters  is introduced. Then, provided some properties such as; (probability density function, cumulative distribution function (CDF), survival function, hazard function, ‎rth moment, mean,   variance, Moment Generating Function, Skewness, kurtosi

 Let  be a connected graph with vertices set  and edges set . The ordinary distance between any two vertices of  is a mapping  from  into a nonnegative integer number such that  is the length of a shortest  path. The maximum distance between two subsets  and  of   is the maximum distance between any two vertices  and  such that  belong to  and  belong to . In this paper, we take a special case of maximum distance when  consists of one vertex and  consists of  vertices, . This distance is defined by: where  is the order of  a graph .

     In this paper, we defined  – polynomials based on

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

In this paper we introduced a new class of - called - and study their basic properties in nano topological spaces. We also introduce -closure and -interior and study some of their fundamental properties.

Transforming the common normal distribution through the generated Kummer Beta model to the Kummer Beta Generalized Normal Distribution (KBGND) had been achieved. Then, estimating the distribution parameters and hazard function using the MLE method, and improving these estimations by employing the genetic algorithm. Simulation is used by assuming a number of models and different sample sizes. The main finding was that the common maximum likelihood (MLE) method is the best in estimating the parameters of the Kummer Beta Generalized Normal Distribution (KBGND) compared to the common maximum likelihood according to Mean Squares Error (MSE) and Mean squares Error Integral (IMSE) criteria in estimating the hazard function. While the pr

     Let R be an associative ring. The essential purpose of the present paper is to introduce the concept of generalized commuting mapping of R. Let U be a non-empty subset of R, a mapping   : R  R is called a generalized commuting mapping on U if there exist a mapping :R R such that =0, holds for all U. Some results concerning the new concept are presented.