In this paper, we study the effect of group homomorphism on the chain of level subgroups of fuzzy groups. We prove a necessary and sufficient conditions under which the chains of level subgroups of homomorphic images of an a arbitrary fuzzy group can be obtained from that of the fuzzy groups . Also, we find the chains of level subgroups of homomorphic images and pre-images of arbitrary fuzzy groups

A new definition of a graph called Pure graph of a ring denote Pur(R) was presented , where the vertices of the graph represent the elements of R such that there is an edge between the two vertices ???? and ???? if and only if ????=???????? ???????? ????=????????, denoted by pur(R) . In this work we studied some new properties of pur(R) finally we defined the complement of pur(R) and studied some of it is properties

In this paper, we introduce and study the notion of the maximal ideal graph of a commutative ring with identity. Let R be a commutative ring with identity. The maximal ideal graph of R, denoted by MG(R), is the undirected graph with vertex set, the set of non-trivial ideals of R, where two vertices I₁ and I₂ are adjacent if I₁ I₂ and I₁+I₂ is a maximal ideal of R. We explore some of the properties and characterizations of the graph.

The concept of the order sum graph associated with a finite group based on the order of the group and order of group elements is introduced. Some of the properties and characteristics such as size, chromatic number, domination number, diameter, circumference, independence number, clique number, vertex connectivity, spectra, and Laplacian spectra of the order sum graph are determined. Characterizations of the order sum graph to be complete, perfect, etc. are also obtained.

     The Syriac language is one of the ancient Semitic languages that appeared in the first century AD. It is currently used in a number of cities in Iraq, Turkey, and others. In this research paper, we tried to apply the work of  Ali and Mahmood 2020  on the letters and words in the Syriac language to find a new encoding for them and increase the possibility of reading the message by other people.

The main object of this paper is to study the representations of monomial groups and characters technique for representations of monomial groups. We refer to monomial groups by M-groups. Moreover we investigate the relation of monomial groups and solvable groups. Many applications have been given the symbol G e.g. group of order 297 is an M-group and solvable. For any group G, the factor group G/G? (G? is the derived subgroup of G) is an M-group in particular if G = Sn, SL(4,R).

In This paper, we introduce the associated graphs of commutative KU-algebra. Firstly, we define the KU-graph which is determined by all the elements of commutative KU-algebra as vertices. Secondly, the graph of equivalence classes of commutative KU-algebra is studied and several examples are presented. Also, by using the definition of graph folding, we prove that the graph of equivalence classes and the graph folding of commutative KU-algebra are the same, where the graph is complete bipartite graph.

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

Pilots are trained using computerized flight simulators. A flight simulator is a training system where pilots can acquire flying skills without need to practice on a real airplane. Simulators are used by professional pilots to practice flying strategies under emergency or hazardous conditions, or to train on new aircraft types. In this study a framework for flight simulation is presented and the layout of an implemented program is described. The calculations were based on simple theoretical approach. The implementation was based on utilizing some of utilities supported by ActiveX, DirectX and OpenGL written in Visual C++. The main design consideration is to build a simple flight simulation program can operate without need to high computer e

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