An edge dominating set    of a graph  is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number  is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G.  The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin

In this paper, the first integrals of Darboux type of the generalized Sprott ET9 chaotic system will be studied. This study showed that the system has no polynomial, rational, analytic and Darboux first integrals for any value of . All the Darboux polynomials for this system were derived together with its exponential factors. Using the weight homogenous polynomials helped us prove the process.

The transition structure is considered as the most important hydraulic structure controlling the w/s transtion, morever it decrease the scouring of outlet structure.

seven experiment samples for transition structure was used in this research at different angles ( 10° - 90° ).

       It was shown that froud number has a clear effect on the depth of the scouring, morever the high discharge rates cause an increase of the ratio between the length of the scour and its depth.

       In order to select the best flaring angle it was shown that the angle of 40° has the most discharge rate, least structure length and least angle scour depth, with the firmly of t

In this paper, Bayes estimators for the shape and scale parameters of Weibull distribution have been obtained using the generalized weighted loss function, based on Exponential priors. Lindley’s approximation has been used effectively in Bayesian estimation. Based on theMonte Carlo simulation method, those estimators are compared depending on the mean squared errors (MSE’s).

   In this paper we give definitions, properties and examples of the notion of  type Ntopological space. Throughout this paper  N is a finite positive  number, N 2. The task of this paper is to study and investigate some properties of such spaces with the existence of a relation between this space and artificial Neural Networks (NN'S), that is we applied the definition of this space in computer field and specially in parallel processing

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.