Through my acquaintance with the literature of Iraqi women, specifically during the first half of the twentieth century, I noticed a lack of interest in this type of literature, which forms part of our literary history. Therefore, I decided to date this literature and extract its output from the stomachs of newspapers and magazines, so that readers can see it and remember the names of the Iraqi poets who defied the difficulties in order to participate in the literary movement and who made their contributions in the field of literature.
The truth is that the forgotten poets of Iraq are many, and I mention them, for example, but not limited to, Wadi’a Al-Shabibi, Wadi’a Taha Najm, Fiyah Abu Qalam, and others. Ibtihaj Atta Amin, Sabi

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 &

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

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

     A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

          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.

In this work,  the study of corona domination in graphs is carried over which was initially proposed by G. Mahadevan et al. Let be a simple graph. A dominating set S of a graph is said to be a corona-dominating set if every vertex in is either a pendant vertex or a support vertex. The minimum cardinality among all corona-dominating sets is called the corona-domination number and is denoted by (i.e) . In this work, the exact value of the corona domination number for some specific types of graphs are given. Also, some results on the corona domination number for some classes of graphs are obtained and the method used in this paper is a well-known number theory concept with some modification this method can also be applied to obt

The topological indices are functions on the graph that do not depend on the labeling of their vertices. They are used by chemists for studying the properties of chemical compounds.  Let  be a simple connected graph. The Hyper-Zagreb index of the graph ,  is defined as  ,where  and  are the degrees of vertex  and , respectively. In this paper, we study the Hyper-Zagreb index and give upper and lower bounds for .

 An edge dominating set    of a graph  is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number  is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G.  The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin

The research dealt with a comparative study between some semi-parametric estimation methods to the Partial linear Single Index Model using simulation. There are two approaches to model estimation two-stage procedure and MADE to estimate this model. Simulations were used to study the finite sample performance of estimating methods based on different Single Index models, error variances, and different sample sizes , and the mean average squared errors were used as a comparison criterion between the methods were used. The results showed a preference for the two-stage procedure depending on all the cases that were used