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Ë‘,

This booklet contains the basic data and graphs forCOVID-19 in Iraq during the first three months of thepandemic ( 24 February to 19 May - 2020 ) , It isperformed to help researchers regarding this health problem (PDF) Information Booklet COVID-19 Graphs For Iraq First 3 Months. Available from: https://www.researchgate.net/publication/341655944_Information_Booklet_COVID-19_Graphs_For_Iraq_First_3_Months#fullTextFileContent [accessed Oct 26 2024].

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

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.

Let G be a finite group, the result is the involution graph of G, which is an undirected simple graph denoted by the group G as the vertex set and x, y ∈ G adjacent if xy and (xy)2 = 1. In this article, we investigate certain properties of G, the Leech lattice groups HS and McL. The study involves calculating the diameter, the radius, and the girth of ΓGRI.

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

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.

      In this paper we used Hosoya polynomial ofgroupgraphs Z_1,...,Z₂₆ after representing each group as  graph and using Dihedral group to"encrypt the plain texts with the immersion property which provided Hosoya polynomial to immerse the cipher text in another"cipher text to become very"difficult to solve.

The subject of the provisions of prayer on the chairs of the important topics in the jurisprudence they fall under the door of the people of excuses, and this section of the important doors in Islamic jurisprudence because it permeates scourge, as prayer is one of the pillars of this religion, and the first thing to be held accountable on the Day of Resurrection prayer If the peace reconciled the rest of his work and spoil corrupted all his work, the street wise was interested in this matter and put him provisions overlooked by many people these days became insulted him and do not pardon him, and do not know the rules and provisions approved by Shara, and the omission of one of these provisions is possible To lead to the invalidity of hi