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

Background: The COVID-19 pandemic has an immense effect not only on the social and economic lives of people but also on the surgical lives of surgeons, residents, nursing staff, and patients as well as ground level staff. Amidst this COVID pandemic, emergency surgeries were being done but at a decreased rate, whereas elective cases depended on the will of hospitals, surgeons, and patients. Study aims to promulgate a "Neo–Surgical Check Box" by amalgamating the WHO surgical checklist and the results obtained from the questionnaires.

Subjects and Methods: After receiving ethical clearance from the Institute Ethical Committee, an online questionnaire with 50 questions divided into

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 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

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

The results showed the spread of disease blight leaves caused by injury fungus Alternaria in different areas of cultivation in the city of Baghdad where he was recording the highest rate and the severity of the disease of 100% and 80%, respectively, in the Abu Ghraib area and the least of 20% and 12% respectively in the Amiriya district results showed test pathogenicity of the fungus pathogen emergence of symptoms of the disease superficial discoloration Authority of black paper when wound areas and yellowing of leaves about race as centrist and leaky latest country clear ????? on Central race after 48 hours ....

   The species Bostrichus capucinus  (L.) (Coleoptera:Bostrichidae) was reported as a new record for Iraq. Diagnostic characters and some information are given .