Let G be a finite group and X be a G-conjugacy of elements of order 3. The A4-graph of G is a simple graph with vertex set X and two vertices x,yÎX are linked if x≠ y and xy^-1 is an involution element. This paper aims to investigate  the A4-graph properties for the monster  Held group He.

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

     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.

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

In this paper, we proved that if R is a prime ring, U be a nonzero Lie ideal of R , d be a nonzero (?,?)-derivation of R. Then if Ua?Z(R) (or aU?Z(R)) for a?R, then either or U is commutative Also, we assumed that Uis a ring to prove that: (i) If Ua?Z(R) (or aU?Z(R)) for a?R, then either a=0 or U is commutative. (ii) If ad(U)=0 (or d(U)a=0) for a?R, then either a=0 or U is commutative. (iii) If d is a homomorphism on U such that ad(U) ?Z(R)(or d(U)a?Z(R), then a=0 or U is commutative.

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

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

In this paper we introduced a new class of - called - and study their basic properties in nano topological spaces. We also introduce -closure and -interior and study some of their fundamental properties.