Due to increased consumption of resources, especially energy it was necessary to find alternatives characterized by the same quality as well as being of less expensive, and most important of these alternatives are characterized by waste and the fact that humancannot stop consumption. So we  have consideredwaste as an  alternative and cheap economic resources and by using environmental index the MIP (input materials per unit ,unit / service) is based on the grounds that the product is not the end of itselfit is a product to meet the need  of a product or service, awarded a resource input and output within the five basic elements are the raw materials is ecological, Raw materials ecological, water, air and soil erosion for a

In this paper, Nordhaus-Gaddum type relations on open support independence number of some derived graphs of path related graphs under addition and multiplication are studied.

     Kp index correlates with the many magnetosphere properties, which are used to measure the level of magnetic activity. In the solar system, the two different planets, Mercury with weak magnetic field and Jupiter with strong magnetic field, are selected for this study to calculate the planet's magnetosphere radius (R_MP) which represents the size of magnetosphere compared with solar activity through Kp index,  through two types of geomagnetic conditions; quiet and strong for the period (2016-2018). From the results, we found that there are reversible relations between them during strong geomagnetic storms, while there are direct relations during quiet geomagnetic conditions. Also it is found that the

Consider the (p,q) simple connected graph . The sum absolute values of the spectrum of quotient matrix of a graph  make up the graph's quotient energy. The objective of this study is to examine the quotient energy of identity graphs and zero-divisor graphs  of commutative rings using group theory, graph theory, and applications. In this study, the identity graphs  derived from the group  and a few classes of zero-divisor graphs  of the commutative ring R are examined.

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.

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.

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.

Let A ⊆ V(H) of any graph H, every node w of H be labeled using a set of numbers; , where d(w,v) denotes the distance between node w and the node v in H, known as its open A-distance pattern. A graph H is known as the open distance-pattern uniform (odpu)-graph, if there is a nonempty subset A ⊆V(H) together with  is the same for all . Here  is known as the open distance pattern uniform (odpu-) labeling of the graph H and A is known as an odpu-set of H. The minimum cardinality of vertices in any odpu-set of H, if it exists, will be known as the odpu-number of the graph H. This article gives a characterization of maximal outerplanar-odpu graphs. Also, it establishes that the possible odpu-number of an odpu-maximal outerplanar graph i