The aim of this paper is to generate topological structure on the power set of vertices of digraphs using new definition which is Gm-closure operator on out-linked of digraphs. Properties of this topological structure are studied and several examples are given. Also we give some new generalizations of some definitions in digraphs to the some known definitions in topology which are Ropen subgraph, α-open subgraph, pre-open subgraph, and β-open subgraph. Furthermore, we define and study the accuracy of these new generalizations on subgraps and paths.

The bourgeoisie groups derived great advantages from the system upon which the Fatimids built up their Regime out the land-tax and other taxes against a fixed sum . The surpulus revenue was the prophet of the farmers . A striking feature of the Fatimid was freedom of enterprise .All sectors of economic life were free-crafts , industry and trade . The government interfered in the trade in victuals only so far to in order to guarantee the supply of wheat to the big towns
The Egyptian Bourgeoisie enjoyed also the great prosperity which was produced among other reasons by the inflationary system of Fatimid economy .
The maintenance of gold dinar being almost pure and of full weight was only possible because Egypt steadily received cons

It is know that the spirit of the Arabic language is statement so it has great importance in the Arabic language and that the Quran, The book of Allah miraculous, and was a likeness crippling those who disagreed with and credence to those who believed in him, and that the holy messenger of Allah bless him and gave the conciseness of speech in its statement and eloquence. For this reason, The subject of this research "The statement" to study the most beautiful of orders and prohibitions (do and don't do) in the holy Qur'an and sunnah, Those which are the two major sources in the legislation

The persons who Allah Ioves them in the holly Quran

Objectivity Study0Dr 0muyad Turky Ali 

Allah men tioned in Auran the loving of benevolent and who Allah loves him gave him everything 0the loving of benevolent came fist and after that the loving of justice who remove injustice and after that loving purified and in noeent 0After that mentioning loving of Knighters ( fighters )The eharity with money and to clear up the justice and loving purified is a reason of accessing paradise 0 

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 result involution graph of a finite group , denoted by  is an undirected simple graph whose vertex set is the whole group  and two distinct vertices are adjacent if their product is an involution element. In this paper, result involution graphs for all Mathieu groups and connectivity in the graph are studied. The diameter, radius and girth of this graph are also studied. Furthermore, several other graph properties are obtained.

In this paper we have made different regular graphs by using block designs. In one of our applicable methods, first we have changed symmetric block designs into new block designs by using a method called a union method. Then we have made various regular graphs from each of them. For symmetric block designs with  (which is named finite projective geometry), this method leads to infinite class of regular graphs. With some examples we will show that these graphs can be strongly regular or semi-strongly regular. We have also propounded this conjecture that if two semi-symmetric block designs are non-isomorphic, then the resultant block graphs of them are non-isomorphic, too.

     Graceful labeling of a graph  with q edges is assigned the labels for its vertices by some integers from the set such that no two vertices received the same label, where each edge is assigned the absolute value of the difference between the labels of its end vertices and the resulting edge labeling running from 1 to  inclusive. An edge labeling of a graph G is called vertex anntimagic, if all vertex weights are pairwise distinct, where the vertex weight of a vertex under an edge labeling is the sum of the label of all edges incident with that vertex.  In this paper, we address the problem of finding graceful antimagic labelin for split of the star graph ,  graph,  graph, jellyfish graph , Dragon graph , ki

The main purpose of this paper, is to introduce a topological space , which is induced by reflexive graph and tolerance graph , such that  may be infinite. Furthermore, we offered some properties of  such as connectedness, compactness, Lindelöf and separate properties. We also study the concept of approximation spaces and get the sufficient and necessary condition that topological space is approximation spaces.

          A total global dominator coloring of a graph  is a proper vertex coloring of  with respect to which every vertex  in  dominates a color class, not containing  and does not dominate another color class. The minimum number of colors required in such a coloring of  is called the total global dominator chromatic number, denoted by . In this paper, the total global dominator chromatic number of trees and unicyclic graphs are explored.