In this thesis, we study the topological structure in graph theory and various related results. Chapter one, contains fundamental concept of topology and basic definitions about near open sets and give an account of uncertainty rough sets theories also, we introduce the concepts of graph theory. Chapter two, deals with main concepts concerning topological structures using mixed degree systems in graph theory, which is M-space by using the mixed degree systems. In addition, the m-derived graphs, m-open graphs, m-closed graphs, m-interior operators, m-closure operators and M-subspace are defined and studied. In chapter three we study supra-approximation spaces using mixed degree systems and primary object in this chapter are two topological

    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 Ais 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.

Despite ample research on soft linear spaces, there are many other concepts that can be studied. We introduced in this paper several new concepts related to the soft operators, such as the invertible operator.  We investigated some properties of this kind of operators and defined the spectrum of soft linear operator along with a number of concepts related with this definition; the concepts of eigenvalue, eigenvector, eigenspace are defined. Finally the spectrum of the soft linear operator was divided into three disjoint parts.

The general objective of surface shape descriptors techniques is to categorize several surface shapes from collection data. Gaussian (K) and Mean (H) curvatures are the most broadly utilized indicators for surface shape characterization in collection image analysis. This paper explains the details of some descriptions (K and H), The discriminating power of 3D descriptors taken away from 3D surfaces (faces) is analyzed and present the experiment results of applying these descriptions on 3D face (with polygon mesh and point cloud representations). The results shows that Gaussian and Mean curvatures are important to discover unique points on the 3d surface (face) and the experiment result shows that these curvatures are very useful for some

The palm vein recognition is one of the biometric systems that use for identification and verification processes since each person have unique characteristics for the veins. In this paper we can improvement palm vein recognition system have been made. The system based on centerline extraction of veins, and employs the concept of Difference-of Gaussian (DoG) Function to construct features vector. The tests results on our database showed that the identification rate is 100 % with the minimum error rate was 0.333.

Watermarking operation can be defined as a process of embedding special wanted and reversible information in important secure files to protect the ownership or information of the wanted cover file based on the proposed singular value decomposition (SVD) watermark. The proposed method for digital watermark has very huge domain for constructing final number and this mean protecting watermark from conflict. The cover file is the important image need to be protected. A hidden watermark is a unique number extracted from the cover file by performing proposed related and successive operations, starting by dividing the original image into four various parts with unequal size. Each part of these four treated as a separate matrix and applying SVD

      In current generation of technology, a robust security system is required based on biometric trait such as human gait, which is a smooth biometric feature to understand humans via their taking walks pattern. In this paper, a person is recognized based on his gait's style that is captured from a video motion previously recorded with a digital camera. The video package is handled via more than one phase after splitting it into a successive image (called frames), which are passes through a preprocessing step earlier than classification procedure operation. The pre-processing steps encompass converting each image into a gray image, cast off all undesirable components and ridding it from noise, discover differen

     The main focus of this article is to introduce the notion of rough pentapartitioned neutrosophic set and rough pentapartitioned neutrosophic topology by using rough pentapartitioned neutrosophic lower approximation, rough pentapartitioned neutrosophic upper approximation, and rough pentapartitioned neutrosophic boundary region. Then, we provide some basic properties, namely operations on rough pentapartitioned neutrosophic set and rough pentapartitioned neutrosophic topology. By defining rough pentapartitioned neutrosophic set and topology, we formulate some results in the form of theorems, propositions, etc. Further, we give some examples to justify the definitions introduced in this article.

In this paper, we introduce and study the concepts of hollow – J–lifting modules and FI – hollow – J–lifting modules as a proper generalization of both hollow–lifting and J–lifting modules . We call an R–module M as hollow – J – lifting if for every submodule N of M with is hollow, there exists a submodule K of M such that M = K Ḱ and K N in M . Several characterizations and properties of hollow –J–lifting modules are obtained . Modules related to hollow – J–lifting modules are  given .