In this work we shall introduce the concept of weakly quasi-prime modules and give some properties of this type of modules.
Throughout this paper R represents commutative ring with identity and M is a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of weak essential submodules which introduced by Muna A. Ahmed, where a submodule N of an R-module M is called weak essential, if N ? P ? (0) for each nonzero semiprime submodule P of M. In this paper we rewrite this definition in another formula. Some new definitions are introduced and various properties of weak essential submodules are considered.
The main object of this paper is to study the representations of monomial groups and characters technique for representations of monomial groups. We refer to monomial groups by M-groups. Moreover we investigate the relation of monomial groups and solvable groups. Many applications have been given the symbol G e.g. group of order 297 is an M-group and solvable. For any group G, the factor group G/G? (G? is the derived subgroup of G) is an M-group in particular if G = Sn, SL(4,R).
The importance of television has emerged as an effective and influential force in the lives of societies and peoples, And not just a professional media since the fifties of the twentieth century, It was used as a platform to achieve the goals and objectives of the media and politics for governments, agencies and individuals in different countries of the world, Using many methods, methods and techniques that later became important major subjects and curricula and a scientific specialization that was founded for him to study and teach in most international universities, The media, especially television and satellite channels, play an active and significant role in managing crises and conflicts and directing them through the methods of deal
... Show MoreThis paper is mainly concerned with the study of the moral aspects that prompts William Shakespeare to attempt a romance in which he has embedded the epitome of his thought, experience, and philosophy concerning certain significant aspects of human life whose absence or negligence may threaten human existence, peace, and stability. From the beginning of history man realizes the importance of prosperity on the many and various levels that touch and address his needs and desires—natural, material, and spiritual. The Tempest, due to the dramatist's awareness of the aforementioned values, reflects the dramatist's duty as to projecting and unfolding these important aspects, rec
... Show MoreIrrigation scheduling techniques is one of the suggested solutions for water scarcity problem. The study aims to show the possibility of using practical and applicable irrigation scheduling program which was designed by Water Resources Department at the University of Baghdad by using Spreadsheet Formulas for Microsoft Excel program, version 2007, with some modification to generalize it and made it applicable to various climatic zone and different soil types, as a salvation for the shortage of irrigation water inside the irrigation projects. Irrigation projects which incidence of Tigris River basin will be taken as an applicable example. This program was based on water budgeting and programmed depending on scientific concepts which facili
... Show MoreThe definition of semi-preopen sets were first introduced by "Andrijevic" as were is defined by :Let (X , ï´ ) be a topological space, and let A ⊆, then A is called semi-preopen set if ⊆∘ . In this paper, we study the properties of semi-preopen sets but by another definition which is equivalent to the first definition and we also study the relationships among it and (open, α-open, preopen and semi-p-open )sets.
Czerwi’nski et al. introduced Lucky labeling in 2009 and Akbari et al and A.Nellai Murugan et al studied it further. Czerwi’nski defined Lucky Number of graph as follows: A labeling of vertices of a graph G is called a Lucky labeling if for every pair of adjacent vertices u and v in G where . A graph G may admit any number of lucky labelings. The least integer k for which a graph G has a lucky labeling from the set 1, 2, k is the lucky number of G denoted by η(G). This paper aims to determine the lucky number of Complete graph Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show More