Pituitary adenomas are the anterior pituitary tumors. Patients with an Aryl Hydrocarbon Receptor-Interacting Protein (AIP) mutation (AIP- mut) tend to have more aggressive tumors occurring at a younger age. Single nucleotide polymorphisms (SNPs) in many studies have been related to metabolic comorbidities in the general population. Study aims investigated the role of AIP gene SNPs with susceptibility to acromegaly pituitary- adenoma, with levels of LH, FSH, TSH, Testosterone, IGF1,GH, FT4 , Prolactin hormones and blood sugar levels.  The study ‎was conducted on a group of acromegaly patients, including 50 patients) both Genders( with ‎hyperplasia of the ends, and apparently healthy control group. Genotyping of

Thirty- five vaginal swab samples were obtained from women vagina.All samples
were subjected to conventional morphological and cultural characteristics, isolates
distributed between Lactobacillus acidophillus(23)and Lactobacillus fermentum (12).
Antibacterial activities were done by well diffusion and blank disk method. The
Lactobacillus was used as aprobiotic treatment against bacteriaisolates from vagina
.The isolated bacteria had strong activity against indicator strains.The results showed
that Lactobacillus which was isolated from vagina by well diffusion method was
effective against pathogenic isolates more than the Lactobacillus isolated by blank
disc method , the highs inhibitory effect of Lactobacillus iso

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 .

In this paper, we introduce a new type of Drazin invertible operator on Hilbert spaces, which is called D-operator. Then, some properties of the class of D-operators are studied. We prove that the D-operator preserves the scalar product, the unitary equivalent property, the product and sum of two D-operators are not D-operator in general but the direct product and tenser product is also D-operator.

Some Results on Fuzzy Zariski

Topology  on Spec(J.L)

In this paper we define and study new concepts of fibrewise topological spaces over B namely, fibrewise closure topological spaces, fibrewise wake topological spaces, fibrewise strong topological spaces over B. Also, we introduce the concepts of fibrewise w-closed (resp., w-coclosed, w-biclosed) and w-open (resp., w-coopen, w-biopen) topological spaces over B; Furthermore we state and prove several Propositions concerning with these concepts.

In this paper we define and study new concepts of functions on fibrewise  topological spaces  over  B namely,  fibrewise  weakly  (resp., closure, strongly) continuoac; funttions which are analogous of weakly

(resp., closure,   strongly)   continuous  functions   and  the  main  result is   : Let  <p       : XY  be a fibrewise  closure  (resp.,  weakly,  closure, strongly,  strongly) continuous function,  where  Y  is fibrewise topological  space  over  B and  X  is  a  fibrewise set  which  has  the

in

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.

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