The aim of this paper is to present a weak form of -light functions by using -open set which is -light function, and to offer new concepts of disconnected spaces and totally disconnected spaces. The relation between them have been studied. Also, a new form of -totally disconnected and inversely -totally disconnected function have been defined, some examples and facts was submitted.

New bidentate Schiff base ligand (L) namely [(Z)-3-(2-oxoindolin-3ylildeneamino)benzoic acid] type (NO) was prepared via condensation of  isatin and 3-amino benzoic acid in ethanol as a solvent in existence of drops of (glac. CH3COOH). The new ligand (L) was characterized base on elemental microanalysis, FT-IR, UV-Vis, 1H-NMR spectra along with melting point. Ligand complexes in general formula [M(L)2Cl2]. H2O, where: MII = Co, Cu, Cd, and Hg; L= C15H10 N2O3 were synthesized and identified by FT-IR, UV-Vis, 1H-NMR (for Cd complex only) spectra, atomic absorption, chloride content along with molar conductivity and magnetic susceptibility. It was found that the ligand behaves as bidentate on complexation via (N) atom of imine group an

The preparation and spectral characterization of complexes for Co(II), Ni(II), Cu(II), Cd(II), Zn(II) and Hg(II) ions with new organic heterocyclic azo imidazole dye as ligand 2-[(2`-cyano phenyl) azo ]-4,5-diphenyl imidazole ) (2-CyBAI) were prepared by reacting a dizonium salt solution of 2-cyano aniline with 4,5-diphenyl imidazole in alkaline ethanolic solution .These complexes were characterized spectroscopically by infrared and electronic spectra along with elemental analysis‚ molar conductance and magnetic susceptibility measurements. The data show that the ligand behaves a bidantate and coordinates to the metal ion via nitrogen atom of azo and with imidazole N3 atom. Octahedral environment is suggested for all metal complex

The topic of the research tagged (narrative structure and its impact on building open and closed endings in the fictional film) is summarized by studying the mechanism of employing closed and open endings in the fictional film. novelist, then the need for it, as well as the objectives of the research and clarifying its limits as well as its importance. Then moving to the theoretical framework, which included three topics, where the first topic was entitled (the cinematic construction of the film narrative), either the second topic (the structure of complexity and narrative solutions), or the third topic dealt with the subject (the structure of the end and its relationship to the construction of the narrative). After completing the theore

The aim of this paper is to derive a posteriori error estimates for semilinear parabolic interface problems. More specifically, optimal order a posteriori error analysis in the - norm for semidiscrete semilinear parabolic interface problems is derived by using elliptic reconstruction technique introduced by Makridakis and Nochetto in (2003). A key idea for this technique is the use of error estimators derived for elliptic interface problems to obtain parabolic estimators that are of optimal order in space and time.

            This work, introduces some concepts in bitopological spaces, which are nm-j-ω-converges to a subset, nm-j-ω-directed toward a set, nm-j-ω-closed mappings, nm-j-ω-rigid set, and nm-j-ω-continuous mappings. The mainline idea in this paper is nm-j-ω-perfect mappings in bitopological spaces such that n = 1,2  and m =1,2 n ≠ m. Characterizations concerning these concepts and several theorems are studied, where j = q , δ, a , pre, b, b.

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i

The class of quasi semi -convex functions and pseudo semi -convex functions are presented in this paper by combining the class of -convex functions with the class of quasi semi -convex functions and pseudo semi -convex functions, respectively. Various non-trivial examples are introduced to illustrate the new functions and show their relationships with -convex functions recently introduced in the literature. Different general properties and characteristics of this class of functions are established. In addition, some optimality properties of generalized non-linear optimization problems are discussed. In this generalized optimization problems, we used, as the objective function, quasi semi -convex (respectively, strictly quasi semi -convex

      In this work, the notion is defined by using    and some properties of this set are studied also,  and   Ù€ set are two concepts that are defined by using ; many examples have been cited to indicate that the reverse of the propositions and remarks is not achieved. In addition, new application example of nano was studied.