BN Rashid

The letters are exposed in some texts of the classical Arabic language (poetry or prose), or in some of the Qur’anic texts, which are the main sources that were adopted on the day when provisions, rules and linguistic controls were established. I say that some of these letters are exposed in some contexts to deletion, mention, or change in the structure and shape of the letter. As for the omission, it is one of the aspects that distinguished Arabic, as well as other languages, for many purposes that differ among their user.

The study was conducted out at the Ministry of Agriculture's Poultry Research Station/Animal ResourcesDepartment/Agricultural Research Center. To see how body weight (BW) and leptin hormone (LEP) levels inbreeder blood affect fertility and hatchability. 140 Iraqi local laying chickens (120 females + 20 males) aged 28weeks were used in the study. Following the numbering of The experiment was divided into three periods,each lasting 28 days, during which the breeder's live body weight was recorded and divided into two categories(greater than 1.5 kg and less than 1.5 kg), and blood samples were collected at the end of each period todetermine the concentration of leptin hormone in the breeders' blood. For comparison between mothers'performance,

In recent decades, tremendous success has been achieved in the advancement of chemical admixtures for Portland cement concrete. Most efforts have concentrated on improving the properties of concrete and studying the factors that influence on these properties. Since the compressive strength is considered a valuable property and is invariably a vital element of the structural design, especially high early strength development which can be provide more benefits in concrete production, such as reducing construction time and labor and saving the formwork and energy. As a matter of fact, it is influenced as a most properties of concrete by several factors including water-cement ratio, cement type and curing methods employed.
Because of acce

Some Results on Fuzzy Zariski

Topology  on Spec(J.L)

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