Preferred Language
Articles
/
jhZ5UYoBVTCNdQwC35S1
On graceful antimagic graphs
...Show More Authors

Scopus Clarivate Crossref
View Publication
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
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 Jan 01 2023
Journal Name
Journal Of Interdisciplinary Mathematics
Studying the result involution graphs for HS and McL Leech lattice groups
...Show More Authors

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.

View Publication
Scopus Clarivate Crossref
Publication Date
Wed Nov 27 2019
Journal Name
Iraqi Journal Of Science
Sum Ideal Graphs Associated to a Given Ideal of a Commutative Ring
...Show More Authors

The aim of this paper is to introduce and study a new kind of graphs associated to an ideal of a commutative ring. Let â„› be a commutative ring with identity, and I(â„›) be the set of all non-trivial ideals of â„› with S I(â„›). The sum ideal graph associated to S, denoted by       Î¨(â„›, S), is the undirected graph with vertex set {A I(â„›): S⊂A+B, for some B I(â„›)} where two ideal vertices A and B are adjacent if and only if A B and S⊂A+B. In this paper we establish some of characterizations and results of this kind of graph with providing some examples.

View Publication Preview PDF
Scopus Crossref
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 (2)
Crossref (2)
Scopus Clarivate Crossref
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
Wed Jun 01 2022
Journal Name
Baghdad Science Journal
Schultz and Modified Schultz Polynomials for Edge – Identification Chain and Ring – for Square Graphs
...Show More Authors

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.

View Publication Preview PDF
Scopus (3)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Mon Nov 19 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Cryptography by Using"Hosoya"Polynomials for"Graphs Groups of Integer Modulen and"Dihedral Groups with'Immersion"Property
...Show More Authors

      In this paper we used Hosoya polynomial ofgroupgraphs Z1,...,Z26 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.

View Publication Preview PDF
Crossref
Publication Date
Sun Jul 31 2022
Journal Name
Iraqi Journal Of Science
The generalized Cayley graph of complete graph K_n and complete multipartite graphs K_(n,n) and K_(n,n,n)
...Show More Authors

Suppose that  is a finite group and  is a non-empty subset of  such that  and . Suppose that  is the Cayley graph whose vertices are all elements of  and two vertices  and  are adjacent if and only if . In this paper, we introduce the generalized Cayley graph denoted by  that  is a graph with vertex set consists of all column matrices  which all components are in  and two vertices  and  are adjacent if and only if , where  is a column matrix that each entry is the inverse of similar entry of  and  is  matrix with all entries in  ,  is the transpose of  and . In this paper, we clarify some basic properties of the new graph and assign the structure of  when  is complete graph , complete bipartite graph  and complete

... Show More
View Publication Preview PDF
Scopus (4)
Crossref (3)
Scopus Crossref