Let M be a n-dimensional manifold. A C1- map f : M  M is called transversal if for all m N the graph of fm intersect transversally the diagonal of MM at each point (x,x) such that x is fixed point of fm. We study the minimal set of periods of f(M per (f)), where M has the same homology of the complex projective space and the real projective space. For maps of degree one we study the more general case of (M per (f)) for the class of continuous self-maps, where M has the same homology of the n-dimensional sphere.

            In this paper, the Normality set  will be investigated. Then, the study highlights some concepts properties and important results. In addition, it will prove that every operator with normality set has non trivial invariant subspace of  .

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

With the development of communication technologies for mobile devices and electronic communications, and went to the world of e-government, e-commerce and e-banking. It became necessary to control these activities from exposure to intrusion or misuse and to provide protection to them, so it's important to design powerful and efficient systems-do-this-purpose. It this paper it has been used several varieties of algorithm selection passive immune algorithm selection passive with real values, algorithm selection with passive detectors with a radius fixed, algorithm selection with passive detectors, variable- sized intrusion detection network type misuse where the algorithm generates a set of detectors to distinguish the self-samples. Practica

Used in the study especially calibrated Erwa to determine the number of neighborhood or the Alayoshi number of bacteria in the count modeling and casting method dishes in addition to using the drop method yielded significant results for a match between the methods used ..

t. The current study was conducted on the umbilical cord blood of newborns in the Banks Hospital in Baghdad, Diyala, and Khalis in Diyala, where the study included 90 samples of blood, and samples were collected for the period from the 1st of October;2020 to The first of February;2021 AD, where the study included measuring levels of interleukin-6;Adiponectin,glucose and bilirubin in the blood, comparison study between the study variables with the child's weight (greater than 3 kg),(less or equal 3 kg),the mother's age (greater than 25 years, less or equal to 25 years),the sex of the child (male, female).The results of our study showed that there were no significant differences between the variables of the current study between the two sex

Let/. It :0 ---0 G be any two self maps of a compact connected oriented Lie group G. In this paper, for each positive integer k , we associate an integer with fk,hi . We relate this number with Lefschetz coincidence number. We deduce that for any two differentiable maps f, there exists a positive integer k such that k 5.2+1 , and there is a point x C G such that ft (x) = (x) , where A is the rank of G . Introduction Let G be an n-dimensional com -pact connected Lie group with multip-lication p ( .e 44:0 xG--+G such that p ( x , y) = x.y ) and unit e . Let [G, G] be the set of homotopy classes of maps G G . Given two maps f , f G ---• Jollowing [3], we write f. f 'to denote the map G-.Gdefined by 01.11® =A/WO= fiat® ,sea Given a point g