Preferred Language
Articles
/
jih-3014
On Antimagic Labeling for Some Families of Graphs
...Show More Authors

Antimagic labeling of a graph  with  vertices and  edges is assigned the labels for its edges by some integers from the set , such that no two edges received the same label, and the weights of vertices of a graph  are pairwise distinct. Where the vertex-weights of a vertex  under this labeling is the sum of labels of all edges incident to this vertex, in this paper, we deal with the problem of finding vertex antimagic edge labeling for some special families of graphs called strong face graphs. We prove that vertex antimagic, edge labeling for strong face ladder graph , strong face wheel graph ,  strong face fan graph , strong face prism graph  and finally strong face friendship graph .

Crossref
View Publication Preview PDF
Quick Preview PDF
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 (2)
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
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
Sat Nov 10 2018
Journal Name
Iraqi National Journal Of Nursing Specialties
Evaluation of the Families, Attitudes toward Environment Pollution
...Show More Authors

Objectives: To evaluate the families’ attitudes toward environment pollution, and determine the relationship
between families’ attitudes towards environment pollution and their demographic characteristics of age,
education, type of family, and socioeconomic status.
Methodology: A descriptive design is carried throughout the present study to evaluate families’ attitudes toward
environment pollution for the period of October 5th2013 to May 7th2014. A non-probability "purposive" sample of
(110) families’ is selected. The sample is comprised of two groups; (75) urban families’ and (35) rural ones. An
evaluation tool is designed and constructed for the purpose of the study. It is consisted of (4) main parts;
dem

... Show More
View Publication Preview PDF
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
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 Jul 02 2006
Journal Name
Journal Of The Faculty Of Medicine Baghdad
sibs of Iraqi families affected by congenital adrenal hyperplasia
...Show More Authors

Background:

View Publication Preview PDF
Crossref
Publication Date
Wed Oct 17 2018
Journal Name
Journal Of Economics And Administrative Sciences
Solve the fuzzy Assignment problem by using the Labeling method
...Show More Authors

The Assignment model is a mathematical model that aims to express a real problem facing factories and companies which is characterized by the guarantee of its activity in order to make the appropriate decision to get the best allocation of machines or jobs or workers on machines in order to increase efficiency or profits to the highest possible level or reduce costs or time To the extent possible, and in this research has been using the method of labeling to solve the problem of the fuzzy assignment of real data has been approved by the tire factory Diwaniya, where the data included two factors are the factors of efficiency and cost, and was solved manually by a number of iterations until reaching the optimization solution,

... Show More
View Publication Preview PDF
Crossref
Publication Date
Wed Mar 01 2023
Journal Name
Baghdad Science Journal
A Study on Co – odd (even) Sum Degree Edge Domination Number in Graphs
...Show More Authors

 An edge dominating set    of a graph  is said to be an odd (even) sum degree edge dominating set (osded (esded) - set) of G if the sum of the degree of all edges in X is an odd (even) number. The odd (even) sum degree edge domination number  is the minimum cardinality taken over all odd (even) sum degree edge dominating sets of G and is defined as zero if no such odd (even) sum degree edge dominating set exists in G. In this paper, the odd (even) sum degree domination concept is extended on the co-dominating set E-T of a graph G, where T is an edge dominating set of G.  The corresponding parameters co-odd (even) sum degree edge dominating set, co-odd (even) sum degree edge domination number and co-odd (even) sum degree edge domin

... Show More
View Publication Preview PDF
Scopus Clarivate Crossref
Publication Date
Sun Feb 03 2019
Journal Name
Journal Of The College Of Education For Women
Orphans and Families of Martyrs of Terrorism Expert System-OFMTES
...Show More Authors

The increasing number of orphans and their organizations and institutes in our community makes it increasingly important to design and develop an expert system that supports decisions concerning orphans and their families. This system can be used by any orphans organization to facilitate its work.
The proposed work is designed to manage the Orphans and Families of Martyrs of Terrorism Expert System (OFMTES) by registry all information about all orphans to display mostly orphan deserves bill, data is entered for each orphan, and with each entry a counter is increased according to this input information; the output result represents the score for that orphan. Different orphans have different scores. Coloring is used to know the degree o

... Show More
View Publication Preview PDF