Preferred Language
Articles
/
bsj-3240
Hn-Domination in Graphs
...Show More Authors

The aim of this article is to introduce a new definition of domination number in graphs called hn-domination number denoted by . This paper presents some properties which show the concepts of connected and independent hn-domination. Furthermore, some bounds of these parameters are determined, specifically, the impact on hn-domination parameter is studied thoroughly in this paper when a graph is modified by deleting or adding a vertex or deleting an edge.

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
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
Tue Jun 01 2021
Journal Name
Political Sciences Journal
Regionalism Hegemony of Political Life in Tunisia and its influence upon construction of Political System
...Show More Authors

The topic area of that’s paper dealing with regionalism hegemony upon ruling affairs and political life in Tunisia, this phenomena had historical origins, even before region of French occupation in 1881, after independence, the regionalism domination was practice and normal, the political system justified it's with many causes, like level of education, connection with Western civilization, enlighten intelligent, economic conditions in coast region and North of Tunisia compared with the South, also the role of President Bourqiba as founder of Modern Tunisia, he was from Monster (North of country) which was dominated as charismatic leader dedicate the regionalism domination through decades, yet after revolution in 2011, little changes ha

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Mar 04 2023
Journal Name
Baghdad Science Journal
Exploration of CPCD number for power graph
...Show More Authors

Recently, complementary perfect corona domination in graphs was introduced. A dominating set S of a graph G is said to be a complementary perfect corona dominating set (CPCD – set) if each vertex in  is either a pendent vertex or a support vertex and  has a perfect matching. The minimum cardinality of a complementary perfect corona dominating set is called the complementary perfect corona domination number and is denoted by . In this paper, our parameter hasbeen discussed for power graphs of path and cycle.

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