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.

Background: The presence of cancer has a profound psychological impact on the quality of life of patients and their families, on family and social relationships, and on role functioning.

Aim of the study: Assess the impact of childhood cancer on patients and their families.

Subjects and methods: A Prospective questionnaire-based study, for 151 patients, had malignancy identified by tumor registry of Children Welfare Teaching Hospital. The information was taken from the parent(s) in the presence of the patient who sometimes answered some questions during the interview.

Result: There was an interview with 151 families of children with cancer in t

F index is a connected graph, sum of the cubes of the vertex degrees. The forgotten topological index has been designed to be employed in the examination of drug molecular structures, which is extremely useful for pharmaceutical and medical experts in understanding the biological activities. Among all the topological indices, the forgotten index is based on degree connectivity on bonds. This paper characterized the forgotten index of union of graphs, join graphs, limits on trees and its complements, and accuracy is measured. Co-index values are analyzed for the various molecular structure of chemical compounds

After a temporary halt to forced thghebr in different cities of Iraq this methodlogy
opeations returned directiy in the areas of political conflict on the ground which are translated
operations and forced displacement violence es they operations aimed at completing the
forced displacement that occurred after the occupation in(2003)which took an upward curve
publicly after these events and some of which are aimed at the liquidation of some provinces
than any demographic diversity of religious or sectarian or alhens and others aimed at
redemographic distribution within the province itself to produce a net sectarian zones as is the
case in Diyala Nineveh and Babylon Baghdad has the epicenter of sectarian violence and th

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.

      In this Ë‘work, we present theË‘ notion of the Ë‘graph for a KU-semigroup  as theË‘undirected simple graphË‘ with the vertices are the elementsË‘ of  and weË‘Ë‘study the Ë‘graph ofË‘ equivalence classesË‘ofË‘  which is determinedË‘ by theË‘ definition equivalenceË‘ relation ofË‘ these verticesË‘, andË‘ then some related Ë‘properties areË‘ given. Several examples are presented and some theorems are proved. ByË‘ usingË‘ the definitionË‘ ofË‘ isomorphicË‘ graph, Ë‘we showË‘ thatË‘ the graphË‘ of equivalence Ë‘classes Ë‘and the Ë‘graphË‘of Ë‘a KU-semigroup Ë‘  areË‘ theË‘ sameË‘,

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.

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 .

Let  be a non-trivial simple graph. A dominating set in a graph is a set of vertices such that every vertex not in the set is adjacent to at least one vertex in the set. A subset  is a minimum neighborhood dominating set if  is a dominating set and if for every  holds. The minimum cardinality of the minimum neighborhood dominating set of a graph  is called as minimum neighborhood dominating number and it is denoted by  . A minimum neighborhood dominating set is a dominating set where the intersection of the neighborhoods of all vertices in the set is as small as possible, (i.e., ). The minimum neighborhood dominating number, denoted by , is the minimum cardinality of a minimum neighborhood dominating set. In other words, it is the