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.

Abstract : This research has tackled about the role of Russia in the international policies which concerning with energy , So the most important states in the world that possesses huge energy resources to be more able in the control over the reality and future production programs and the distribution of global energy alike , the latter had effectively influence on the economic and developmental aspects within many countries in the world and its impacts on political decisions and perhaps effected too much in the dimensions of strategic policies . In this context of research , Russia has been developed a high energy policy of strategic planning in order to restoring Russia position and its global role by using its potential powerful streng

Earth’s climate changes rapidly due to the increases in human demands and rapid economic growth. These changes will affect the entire biosphere, mostly in negative ways. Predicting future changes will put us in a better position to minimize their catastrophic effects and to understand how humans can cope with the new changes beforehand. In this research, previous global climate data set observations from 1961-1990 have been used to predict the future climate change scenario for 2010-2039. The data were processed with Idrisi Andes software and the final Köppen-Geiger map was created with ArcGIS software. Based on Köppen climate classification, it was found that areas of Equator, Arid Steppes, and Snow will decrease by 3.9 %, 2.96%, an

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.

This research aims to test the causal relationship long-and short-run between the price of gold the global crude oil price and the exchange rate of the dollar and how you can take advantage of the nature of this relationship, particularly in the Arab oil states that achieve huge surpluses, including Iraq and how to keep on the purchasing power of these surpluses or reduce the levels of risk.

The problem is that the Arab oil countries, adversely affected, as a result of that relationship, due to the fact that its role confined to the sale of crude oil only. They do not have control in the dollar, then they are not able to take advantage of its impact on the price of gold the fact that gold is effective pr

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

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 .

In this paper, the main work is to minimize a function of three cost criteria for scheduling n jobs on a single machine. We proposed algorithms to solve the single machine scheduling multiobjective problem. In this problem, we consider minimizing the total completion times, total tardiness and maximum tardiness criteria. First a branch and bound (BAB) algorithm is applied for the 1//∑Ci+∑Ti+Tmax problem. Second we compare two multiobjective algorithms one of them based on (BAB) algorithm to find the set of efficient (non dominated) solutions for the 1//(∑Ci ,∑Ti ,Tmax) problem. The computational results show that the algorithm based on (BAB) algorithm is better than the other one for generated the total number of