In this paper, a new idea to configure a special graph from the discrete topological space is given. Several properties and bounds of this topological graph are introduced. Such that if the order of the non-empty set equals two, then the topological graph is isomorphic to the complete graph. If the order equals three, then the topological graph is isomorphic to the complement of the cycle graph. Our topological graph has complete induced subgraphs with order or more. It also has a cycle subgraph. In addition, the clique number is obtained. The topological graph is proved simple, undirected, connected graph. It has no pendant vertex, no isolated vertex and no cut vertex. The minimum and maximum degrees are evaluated. So , the radius and diameter are studied here.
Form the series of generalization of the topic of supra topology is the generalization of separation axioms . In this paper we have been introduced (S * - SS *) regular spaces . Most of the properties of both spaces have been investigated and reinforced with examples . In the last part we presented the notations of supra *- -space ( =0,1) and we studied their relationship with (S * - SS *) regular spaces.
Random laser gain media is synthesized with different types of dye at the same concentration (1×10-3 M) as an active material and silicon dioxide NPs (silica SiO2) as scatter centers through the Sol-Gel technique. The prepared samples are tested with UV–Vis spectroscopy, Fluorescence Spectroscopy, Field Emission Scanning Electron Microscopy (FESEM), and Energy Dispersive X-ray Diffraction (EDX). The end result demonstrates that doped dyes with silica nanoparticles at a concentration of 0.0016 mol/ml have lower absorbance and higher fluorescence spectra than pure dyes. FESEM scans revealed that the morphology of nanocrystalline silica is clusters of nano-sized spherical particles in the range (25-67) nm. It is con
... Show MoreIn this thesis, we introduced some types of fibrewise topological spaces by using a near soft set, various related results also some fibrewise near separation axiom concepts and a fibrewise soft ideal topological spaces. We introduced preliminary concepts of topological spaces, fibrewise topology, soft set theory and soft ideal theory. We explain and discuss new notion of fibrewise topological spaces, namely fibrewise soft near topological spaces, Also, we show the notions of fibrewise soft near closed topological spaces, fibrewise soft near open topological spaces, fibrewise soft near compact spaces and fibrewise locally soft near compact spaces. On the other hand, we studied fibrewise soft near forms of the more essent
... Show MoreThe microbend sensor is designed to experience a light loss when force is applied to the sensor. The periodic microbends cause propagating light to couple into higher order modes, the existing higher order modes become unguided modes. Three models of deform cells are fabricated at (3, 5, 8) mm pitchand tested by using MMF and laser source at 850 nm. The maximum output power of (8, 5, 3)mm model is (3, 2.7, 2.55)nW respectively at applied force 5N and the minimum value is (1.9, 1.65, 1.5)nW respectively at 60N.The strain is calculated at different microbend cells ,and the best sensitivity of this sensor for cell 8mm is equal to 0.6nW/N.
Discrete logarithms are applied in many cryptographic problems . For instance , in public key . and for construction of sets with disti nct sums of k-clcments. The purpose o r this paper
is to modify the method ol' informationl1·iding using discrete logarithms , introduce new properties of St - sets , uscdthe direct product of groups to construct cyclic group and finally, present modified method for knapsack &
... Show MoreCzerwi’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 Kn, Complete bipartite graph Km,n and Complete tripartite graph Kl,m,n. It has also been studied how the lucky number changes whi
... Show MoreAnomaly detection is still a difficult task. To address this problem, we propose to strengthen DBSCAN algorithm for the data by converting all data to the graph concept frame (CFG). As is well known that the work DBSCAN method used to compile the data set belong to the same species in a while it will be considered in the external behavior of the cluster as a noise or anomalies. It can detect anomalies by DBSCAN algorithm can detect abnormal points that are far from certain set threshold (extremism). However, the abnormalities are not those cases, abnormal and unusual or far from a specific group, There is a type of data that is do not happen repeatedly, but are considered abnormal for the group of known. The analysis showed DBSCAN using the
... Show MoreFive N-substituted acrylamides were prepared by reaction of substituted aromatic primary amines with acryloyl chloride in the presence of triethyl amine. The synthesized acrylamides were allowed to introduce copolymerization reaction with three vinylic monomers including acrylonitrile, methyl acrylate and methyl methacrylate respectively to obtain eleven new copolymers having different physical properties which may used in different applications.