Preferred Language
Articles
/
ijs-6781
More on Result Involution Graphs
...Show More Authors

     The result involution graph of a finite group , denoted by  is an undirected simple graph whose vertex set is the whole group  and two distinct vertices are adjacent if their product is an involution element. In this paper, result involution graphs for all Mathieu groups and connectivity in the graph are studied. The diameter, radius and girth of this graph are also studied. Furthermore, several other graph properties are obtained.

Scopus Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
An Investigation of Corona Domination Number for Some Special Graphs and Jahangir Graph
...Show More Authors

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

... Show More
View Publication Preview PDF
Scopus (3)
Crossref (2)
Scopus Clarivate Crossref
Publication Date
Tue Jan 30 2024
Journal Name
Iraqi Journal Of Science
Generalized Schultz and Modified Schultz Polynomials for Some Special Graphs
...Show More Authors

With simple and undirected connected graph Φ, the Schultz and modified Schultz polynomials are defined as  and , respectively, where the summation is taken over all unordered pairs of distinct vertices in V(Φ), where V(Φ) is the vertex set of Φ, degu  is the degree of vertex u and d(v,u) is the ordinary distance between v and u, u≠v. In this study, the Shultz distance, modified Schultz distance, the polynomial, index, and average for both have been generalized, and this generalization has been applied  to some special graphs.

View Publication Preview PDF
Scopus Crossref
Publication Date
Sat Jun 27 2020
Journal Name
Iraqi Journal Of Science
Lower and Upper Bounds for Hyper-Zagreb Index of Graphs
...Show More Authors

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 .

View Publication Preview PDF
Scopus (3)
Scopus Crossref
Publication Date
Wed May 27 2020
Journal Name
Research Gate
Information Booklet COVID-19 Graphs For Iraq First 3 Months
...Show More Authors

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

Preview PDF
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
A Characterization of Maximal Outerplanar-Open Distance Pattern Uniform Graphs
...Show More Authors

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

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Sat Mar 04 2023
Journal Name
Baghdad Science Journal
Nordhaus-Gaddum Type Relations on Open Support Independence Number of Some Path Related Graphs Under Addition and Multiplication
...Show More Authors

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.

View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Sun Sep 30 2012
Journal Name
College Of Islamic Sciences
Meaning of formulation غ more actions      In Surat Al-Baqarah at the pride of honor
...Show More Authors

Praise be to God, who started his book with the praise of himself and prayers and peace be upon those who do not have a prophet after him and his family and companions and those who followed them with charity until the Day of Judgment. Either:
      The research examines the meanings of the formulas of the increased verbs that were mentioned in Surat Al-Baqara, at the imam of the imams of the Islamic nation, namely, Al-Fakhri Al-Razi (d. 606 AH), may God Almighty have mercy on him. With the imams of Quranic scholars.

View Publication Preview PDF
Publication Date
Tue Aug 31 2021
Journal Name
Iraqi Journal Of Science
Investigation of Commuting Graphs for Elements of Order 3 in Certain Leech Lattice Groups
...Show More Authors

      Assume that G is a finite group and X is a subset of G. The commuting graph is denoted by С(G,X) and has a set of vertices X with two distinct vertices x, y Î X, being connected together on the condition of xy = yx. In this paper, we investigate the structure of Ϲ(G,X) when G is a particular type of Leech lattice groups, namely Higman–Sims group HS and Janko group J2, along with  X as a G-conjugacy class of elements of order 3. We will pay particular attention to analyze the discs’ structure and determinate the diameters, girths, and clique number for these graphs.

View Publication Preview PDF
Scopus (2)
Scopus Crossref
Publication Date
Sun May 15 2022
Journal Name
Al-kindy College Medical Journal
A serology conundrum – HIV infection in acute babesiosis infection could merely be a false positive result
...Show More Authors

Babesiosis is a tick-borne disease caused by Babesia microti. We present a case of false positive HIV in the setting of confirmed babesiosis infection. An understanding that patients with babesiosis can have a false positive HIV test result is important in management decisions.

 

View Publication Preview PDF
Crossref (1)
Crossref
Publication Date
Sun Mar 01 2020
Journal Name
Journal Of Accounting And Financial Studies ( Jafs )
Impact assessment of strategic goods on government grants and as a result of activity: An analytical study at the General Company of grain trading
...Show More Authors

  In Iraq,  government contributions to the public companies have become a very important aspect which contributes to the survival and sustainability of these institutions as it consider  one of the main sources of funding, if not it consider the basis of funding.

  According to  the vital roles assigned to these institutions to follow up, which usually  include important activities in the national economy, the research focused on studying the field reality of the method used in evaluating the stock of total production and purchases of goods for the purpose of selling the strategic commodities of the General Company for Grain Trade.  As a result, the aim of this study came to came to highlight&n

... Show More
View Publication Preview PDF