Some Results on Fuzzy Zariski

Topology  on Spec(J.L)

Nanoparticles are a special group of materials with unique features and extensive applications in diverse fields. The use of nanoparticles of some metals is a viable solution to stop infectious diseases due to the antimicrobial properties of these nanoparticles. The present work demonstrates the effect of silver nanoparticles (AgNPs) on the antibacterial activity of four different antibiotics (amoxicillin, ceftriaxone, chloramphenicol, and penicillin) against eleven Gram-positive and Gram-negative isolates. Disk diffusion method was used to determine the antibacterial activity of various classes of antibiotics in the absence and presence of sub-inhibitory silver nanoparticles of concentration (80 microgram/ml). A synergistic effect was o

Films of silver oxide of different thickness have been prepared by the chemical spray paralysis. Transmission and absorption spectra have recorded in order to study the effect of increasing thickness on some optical parameter such as reflectance, refractive index , and dielectric constant in its two parts . This study reveals that all these paramters affect by increasing the thickness .

Forty eight isolates (41.02%) were obtained from 117 wound and burn samples. The isolates that showed high resistance for both antibiotic was two only that represent 4,1% from all isolates. The result of PCR product electrophoresis was referred that the gene is VIM gene. Lactose and raffinose showed double increasing in diameter of inhibition zone of imipenem with 1% that mean showed highest susceptibility that decreased with the concentration increasing, the same result were with meropenem. But no effect were detected on meropenem inhibition zone diameter. Mannose have no effect on the resistance in 1%, 3% and 7%. Results showed that only three case that increase the expression of gene, they were lactose at 1% concentration that increased

This study was conducted in a laboratory experiment at the University of Baghdad, College of Science, computing Department, 5 km from the center of Baghdad city, in 2021 to evaluate the sorting method for the tomato crop. The experiments were conducted in a factorial experiment under a complete randomized design with three replications and using SAS analysis, artificial neural network, image processing, the study of external characteristics, and physical features; fruit surface area and fruit circumference were 1334.46 cm2,57.53 cm2 and free diseases. The error value was less than zero, while training with outputs recorded the highest value and which was 5. The neural network's performance between the input and the mean square of th

      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