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

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

The problem of finding the cyclic decomposition (c.d.) for the groups ), where  prime upper than 9 is determined in this work. Also, we compute the Artin characters (A.ch.) and Artin indicator (A.ind.) for the same groups, we obtain that after computing the conjugacy classes, cyclic subgroups, the ordinary character table (o.ch.ta.) and the rational valued character table for each group.

The research aims to investigate the existence of a direct causal relationship between selected agricultural variables: agricultural output (as a representative of growth in the agricultural sector), agricultural terms of trade as a completely new variable in agricultural studies in recent years, agricultural labour which is an important part in the total workforce for Iraq, and finally, agricultural investment because of its importance and vital role in the production process, creating job opportunities, and then raising the level of employment, then it's role to achieving agricultural growth and development. For this purpose, the researchers used the Toda-Yamamoto causality methodology for a time series covering from 1990 to 2019. The res

The local resolving neighborhood  of a pair of vertices  for  and  is if there is a vertex  in a connected graph  where the distance from  to  is not equal to the distance from  to , or defined by . A local resolving function  of  is a real valued function   such that  for  and . The local fractional metric dimension of graph  denoted by , defined by  In this research, the author discusses about the local fractional metric dimension of comb product are two graphs, namely graph  and graph , where graph  is a connected graphs and graph  is a complate graph &

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 introduce the basic of definitions of groups for geometric figures; we describe some of geometric figures by using the properties of groups. The classification of some geometric figures by using the properties of some algebraic structures.

Background. Aneurysms of the distal anterior cerebral artery (DACA) are uncommon; they often form near the pericallosal-callosomarginal junction and are typically small. To our knowledge, giant DACA aneurysms developing from the more distant parts of the anterior cerebral artery (ACA), A4-5, have been described only once in the literature. Case description. A 66-year-old gentleman reported with a brief loss of consciousness followed by weakness in his right lower leg. The patient was admitted with a Glasgow Coma Score (GCS) of 15. A computed tomography (CT) scan of the head revealed a left hyperdense mass in the frontal parasagittal supracallosal region. Contrast MRI revealed a heterogeneously enhancing mass measuring 35x30x25 mm. C

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 special cases.

          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.