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

Scopus Clarivate Crossref
View Publication
Publication Date
Tue Jun 01 2021
Journal Name
Baghdad Science Journal
The Dominant Metric Dimension of Corona Product Graphs
...Show More Authors

The metric dimension and dominating set are the concept of graph theory that can be developed in terms of the concept and its application in graph operations. One of some concepts in graph theory that combine these two concepts is resolving dominating number. In this paper, the definition of resolving dominating number is presented again as the term dominant metric dimension. The aims of this paper are to find the dominant metric dimension of some special graphs and corona product graphs of the connected graphs  and , for some special graphs  . The dominant metric dimension of  is denoted by  and the dominant metric dimension of corona product graph G and H is denoted by .

View Publication Preview PDF
Scopus (17)
Crossref (4)
Scopus Clarivate Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
Minimum Neighborhood Domination of Split Graph of Graphs
...Show More Authors

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

... Show More
View Publication Preview PDF
Scopus (3)
Scopus Clarivate Crossref
Publication Date
Tue Dec 01 2020
Journal Name
Baghdad Science Journal
Fractional Local Metric Dimension of Comb Product Graphs
...Show More Authors

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 &

... Show More
View Publication Preview PDF
Scopus (6)
Crossref (1)
Scopus Clarivate Crossref
Publication Date
Sat Apr 01 2023
Journal Name
Baghdad Science Journal
Detour Polynomials of Generalized Vertex Identified of Graphs
...Show More Authors

The Detour distance is one of the most common distance types used in chemistry and computer networks today. Therefore, in this paper, the detour polynomials and detour indices of vertices identified of n-graphs which are connected to themselves and separated from each other with respect to the vertices for n≥3 will be obtained. Also, polynomials detour and detour indices will be found for another graphs which have important applications in Chemistry.

 

View Publication Preview PDF
Scopus (3)
Crossref (2)
Scopus Crossref
Publication Date
Sat Apr 09 2022
Journal Name
Wireless Personal Communications
Strongly Connected Ramanujan Graphs for Highly Symmetric LDPC Codes
...Show More Authors

View Publication
Scopus Clarivate Crossref
Publication Date
Tue Aug 01 2023
Journal Name
Baghdad Science Journal
Total Global Dominator Coloring of Trees and Unicyclic Graphs
...Show More Authors

          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.

View Publication Preview PDF
Scopus (1)
Scopus Crossref
Publication Date
Sun Oct 03 2021
Journal Name
Journal Of Discrete Mathematical Sciences And Cryptography
Analysing the structure of A4-graphs for Mathieu groups
...Show More Authors

View Publication
Scopus (3)
Scopus Clarivate Crossref
Publication Date
Mon Nov 19 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Science
Study of Two Types Finite Graphs in KU-Semigroups
...Show More Authors

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ˑ, in special cases.

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
Sun May 16 2021
Journal Name
Graphs And Combinatorics
Commuting Involution Graphs for Certain Exceptional Groups of Lie Type
...Show More Authors
Abstract<p>Suppose that <italic>G</italic> is a finite group and <italic>X</italic> is a <italic>G</italic>-conjugacy classes of involutions. The commuting involution graph <inline-formula><alternatives><tex-math>$${\mathcal {C}}(G,X)$$</tex-math><math xmlns:mml="http://www.w3.org/1998/Math/MathML"> <mrow> <mi>C</mi> <mo>(</mo> <mi>G</mi> <mo>,</mo> <mi>X</mi> <mo>)</mo> </mrow> </math></alternatives></inline-formula> is</p> ... Show More
View Publication
Scopus (4)
Crossref (1)
Scopus Clarivate Crossref