Preferred Language
Articles
/
bsj-43
Tadpole Domination in Graphs
...Show More Authors

A new type of the connected domination parameters called tadpole domination number of a graph is introduced. Tadpole domination number for some standard graphs is determined, and some bounds for this number are obtained. Additionally, a new graph, finite, simple, undirected and connected, is introduced named weaver graph. Tadpole domination is calculated for this graph with other families of graphs.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Sat Oct 01 2022
Journal Name
Al–bahith Al–a'alami
DOMINATION OF CONTENT OVER FORM IS ONE OF THE PROBLEMS OF CHILDREN’S STORIES IN IRAQ
...Show More Authors

 

The stories of children in Iraq during the past two decades have received a number of important scientific studies. Despite tyranny of the historical study method on most of these studies, they have been and still are very important, because they have established a chronicle of this literary style that has been neglected and based not only on the academic level and serious in-depth university studies but also on the enclosed sight that doesn’t consider studied art as an innovation with its specificity and its typical technical components. While many of the public impressions and self-reflections contributed to the dominance of some of the provisions and concepts that were circulated as critical remarks and adopted by som

... Show More
View Publication Preview PDF
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 (5)
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 (2)
Crossref (1)
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
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
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
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
Publication Date
Mon Sep 21 2020
Journal Name
Iraqi Journal For Electrical And Electronic Engineering
Emotion Recognition Based on Mining Sub-Graphs of Facial Components
...Show More Authors

Facial emotion recognition finds many real applications in the daily life like human robot interaction, eLearning, healthcare, customer services etc. The task of facial emotion recognition is not easy due to the difficulty in determining the effective feature set that can recognize the emotion conveyed within the facial expression accurately. Graph mining techniques are exploited in this paper to solve facial emotion recognition problem. After determining positions of facial landmarks in face region, twelve different graphs are constructed using four facial components to serve as a source for sub-graphs mining stage using gSpan algorithm. In each group, the discriminative set of sub-graphs are selected and fed to Deep Belief Network (DBN) f

... Show More
View Publication Preview PDF
Crossref
Publication Date
Tue Dec 05 2023
Journal Name
Baghdad Science Journal
Further Results on (a, d) -total Edge Irregularity Strength of Graphs
...Show More Authors

Consider a simple graph   on vertices and edges together with a total  labeling . Then ρ is called total edge irregular labeling if there exists a one-to-one correspondence, say  defined by  for all  where  Also, the value  is said to be the edge weight of . The total edge irregularity strength of the graph G is indicated by  and is the least  for which G admits   edge irregular h-labeling.  In this article,   for some common graph families are examined. In addition, an open problem is solved affirmatively.

View Publication Preview PDF
Scopus 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 (2)
Scopus Clarivate Crossref