The leaves and stems of the local Purslane plant ( Portulaca oleracea oleracea L. ) were used to preapare the extract of two types ( wet and dried extractions) the extracts were prepared by weighting of 60grams of the wet and the dried plant individually, then boiled in 500ml of distal water. Finally the volume was completed to1 liter, then we used these extracts to prepare of 8 types of the culture media contained basic, selective and enrichment media for growing a group of pathogenic bacteria. 8 types of bacteria were used for this purpose: Escherichia coli, Pseudomonas flouresence, Staphylococcus aureus , Staphylococcus epidermidis, Bacillus subtilis , Klebsiella pneumoniae , Proteus mirabilis and Proteus vulgaris. The stastica

Some Results on Fuzzy Zariski

Topology  on Spec(J.L)

Each book has a specific style in which its author walks on it from its beginning to its end, and the Holy Qur’an is a book that compiled many methods that were indicative of its miracle, and that it is one unit even though it has been astrologer for twenty-three years.
There is no doubt that knowledge of the Qur’anic methods is one of the pillars of the approach that deals with any of the Qur’an, and the multiplicity of Qur’anic methods is a fact that has many causes. It has been expressed by the Qur’anic discharge and the conjugation of verses to bring them to different methods, and on multiple forms such as nominal, actual, singular Qur’an, presentation, delay, deletion, mention, abbreviation and redundancy. The Qur'ani

The predisposing factors and their effect on the increasing of vulvovaginal Candidiasis have been studied in this research. The result indicated that the highest of infection with vaginal Candidias was in the age of women with age of (21-30years) with vaginal itching and discharge, also the results revealed that the pregnancy was the main predisposing factor. The percentage of the infected pregnant Ladies was 33.7% followed by the women who used the IUCD and OCP 22.1%, those who used steroids 5.2% comparing with control women (without predisposing factors).The results also indicated that the most cases of infection were during the third trimester of pregnancy (where the rate of infedion) was 53.9%.-OCP- Oral Contraceptive Pills-IUCD- Intrr

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

      The 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.

A class of hyperrings known as divisible hyperrings will be studied in this paper. It will be presented as each element in this hyperring is a divisible element. Also shows the relationship between the Jacobsen Radical, and the set of invertible elements and gets some results, and linked these results with the divisible hyperring. After going through the concept of divisible hypermodule that presented 2017, later in 2022, the concept of the divisible hyperring will be related to the concept of division hyperring, where each division hyperring is divisible and the converse is achieved under conditions that will be explained in the theorem 3.14. At the end of this paper, it will be clear that the goal of this paper is to study the concept

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 K_n, Complete bipartite graph K_m,n and Complete tripartite graph K_l,m,n. It has also been studied how the lucky number changes whi