We introduced the nomenclature of orthogonal G -m-derivations and orthogonal generalized G -m-derivations in semi-prime G -near-rings and provide a few essentials and enough provision for generalized G -n-derivations in semi-prime G -near-rings by orthogonal.
A space X is named a πp – normal if for each closed set F and each π – closed set F’ in X with F ∩ F’ = ∅, there are p – open sets U and V of X with U ∩ V = ∅ whereas F ⊆ U and F’ ⊆ V. Our work studies and discusses a new kind of normality in generalized topological spaces. We define ϑπp – normal, ϑ–mildly normal, & ϑ–almost normal, ϑp– normal, & ϑ–mildly p–normal, & ϑ–almost p-normal and ϑπ-normal space, and we discuss some of their properties.
In this thesis, we introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we studied some pawlak's concepts and generalization rough set theory, we introduce a new types for approximation rough digraphs depending on supra open digraphs. In addition, we present two various standpoints to define generalized membership relations, and state the implication between it, to classify the digraphs and help for measure exactness and roughness of digraphs. On the other hand, we define several kinds of fuzzy digraphs. We also introduce a topological space, which is induced by reflexive graph and tolerance graphs, such that the graph may be infinite. Furthermore, we offered some properties of th
... Show MoreThe primary objective of this paper, is to introduce eight types of topologies on a finite digraphs and state the implication between these topologies. Also we used supra open digraphs to introduce a new types for approximation rough digraphs.
By use the notions pre-g-closedness and pre-g-openness we have generalized a class of separation axioms in topological spaces. In particular, we presented in this paper new types of regulαrities, which we named ρgregulαrity and Sρgregulαrity. Many results and properties of both types have been investigated and have illustrated by examples.
The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.
The current research aims to measure Generalized Anxiety Disorder among students of the University of Sulaymaniyah / College of Basic Education, and to identify the significance of differences between sex, scientific specialization and age, and for that reason, the research sample of (102) male and female students was chosen in a random manner, and the researcher used the diagnostic criteria for the generalized anxiety disorder contained He mentioned it in the Statistical and Diagnostic Manual of Psychiatry, and the paragraphs of the scale were formulated according to those standards after they verify the conditions of honesty and consistency, and the use of appropriate statistical means. The results of the research indicated that genera
... Show More
Here we determined the structure of a cold active family IV esterase (EstN7) cloned
Let R be a commutative ring with identity 1 ¹ 0, and let M be a unitary left module over R. A submodule N of an R-module M is called essential, if whenever N ⋂ L = (0), then L = (0) for every submodule L of M. In this case, we write N ≤e M. An R-module M is called extending, if every submodule of M is an essential in a direct summand of M. A submodule N of an R-module M is called semi-essential (denoted by N ≤sem M), if N ∩ P ≠ (0) for each nonzero prime submodule P of M. The main purpose of this work is to determine and study two new concepts (up to our knowledge) which are St-closed submodules and semi-extending modules. St-closed submodules is contained properly in the class of closed submodules, where a submodule N of
... Show MoreDans la langue française, une forme d'auxiliarité, composée de deux éléments cohérents l'auxiliant et l'auxilié, fournit, en effet, à la phrase une diversité significative et structurale. L'auxiliarité, renvoie à l'unification de deux éléments grammaticaux afin de localiser l'énoncé sur l'axe du temps, d'aspect ou de mode. É. Benveniste définit l'auxiliarité en : « Il s'agit d'une forme linguistique unitaire qui se réalise, à travers des paradigmes entiers, en deux éléments, dont chacun assume une partie des fonctions grammaticales, et qui sont à la fois liés et autonomes, distincts et complémentaires »[1]. Ces deux éléments d'auxiliarité possèden
... Show More