Preferred Language
Articles
/
bsj-8404
Minimum Neighborhood Domination of Split Graph of Graphs

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 smallest number of vertices needed to form a minimum neighborhood-dominating set. The concept of minimum neighborhood dominating set is related to the study of the structure and properties of graphs and is used in various fields such as computer science, operations research, and network design. A minimum neighborhood dominating set is also useful in the study of graph theory and has applications in areas such as network design and control theory. This concept is a variation of the traditional dominating set problem and adds an extra constraint on the intersection of the neighborhoods of the vertices in the set. It is also an NP-hard problem. The main aim of this paper is to study the minimum neighborhood domination number of the split graph of some of the graphs.

Scopus Clarivate Crossref
View Publication Preview PDF
Quick Preview PDF
Publication Date
Thu Jan 01 2015
Journal Name
Algebra Letters
THE GRAPH OF A COMMUTATIVE KU-ALGEBRA

In This paper, we introduce the associated graphs of commutative KU-algebra. Firstly, we define the KU-graph which is determined by all the elements of commutative KU-algebra as vertices. Secondly, the graph of equivalence classes of commutative KU-algebra is studied and several examples are presented. Also, by using the definition of graph folding, we prove that the graph of equivalence classes and the graph folding of commutative KU-algebra are the same, where the graph is complete bipartite graph.

Publication Date
Thu Nov 01 2018
Journal Name
2018 1st Annual International Conference On Information And Sciences (aicis)
Speech Emotion Recognition Using Minimum Extracted Features

Recognizing speech emotions is an important subject in pattern recognition. This work is about studying the effect of extracting the minimum possible number of features on the speech emotion recognition (SER) system. In this paper, three experiments performed to reach the best way that gives good accuracy. The first one extracting only three features: zero crossing rate (ZCR), mean, and standard deviation (SD) from emotional speech samples, the second one extracting only the first 12 Mel frequency cepstral coefficient (MFCC) features, and the last experiment applying feature fusion between the mentioned features. In all experiments, the features are classified using five types of classification techniques, which are the Random Forest (RF),

... Show More
View Publication Preview PDF
Scopus (7)
Scopus Clarivate Crossref
Publication Date
Sat Jan 01 2011
Journal Name
Journal Of Computer Sciences
Connectedness in Graphs and Gm-Closure Spaces

This paper is devoted to the discussion the relationships of connectedness between some types of graphs (resp. digraph) and Gm-closure spaces by using graph closure operators.

Preview PDF
Publication Date
Mon Nov 19 2018
Journal Name
Ibn Al-haitham Journal For Pure And Applied Sciences
Study of Two Types Finite Graphs in KU-Semigroups

      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Ë‘,

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Jul 01 2010
Journal Name
Political Sciences Journal
العراق وسياسة حسن الجوار تجاه تركيا وايران

العراق وسياسة حسن الجوار تجاه تركيا

View Publication Preview PDF
Crossref
Publication Date
Wed Dec 01 2021
Journal Name
Journal Of Economics And Administrative Sciences
Reducing Organizational Anomie in Light of Entrepreneurial Behavior

The research aims to clarify the role of the main variable represented by the four dimensions of entrepreneurial behavior (creative, risk-taking, seizing opportunities, proactivity), in Reducing the dependent variable of organizational anomie with the dimensions (Organizational Normlessness, Organizational Cynicism, Organizational Valuelessness).

The experimental, analytical method was adopted in the completion of the research, and an intentional sample of (162) individuals in the administrative levels (higher and middle) in the factory was taken. The questionnaire was also adopted as the main tool, which

... Show More
View Publication Preview PDF
Crossref
Publication Date
Thu Jan 01 2015
Journal Name
Journal Of Theoretical And Applied Information Technology
Graph based text representation for document clustering

Advances in digital technology and the World Wide Web has led to the increase of digital documents that are used for various purposes such as publishing and digital library. This phenomenon raises awareness for the requirement of effective techniques that can help during the search and retrieval of text. One of the most needed tasks is clustering, which categorizes documents automatically into meaningful groups. Clustering is an important task in data mining and machine learning. The accuracy of clustering depends tightly on the selection of the text representation method. Traditional methods of text representation model documents as bags of words using term-frequency index document frequency (TFIDF). This method ignores the relationship an

... Show More
Preview PDF
Scopus (15)
Scopus
Publication Date
Thu Dec 15 2022
Journal Name
Al-academy
The image of the soldier in contemporary Iraqi painting

The research tagged (the image of the soldier in contemporary Iraqi painting) dealt with the concept of the image as one of the basic concepts in the creative achievement, whether it is in the field of art, literature or beauty. Therefore, the concept of the image expanded to express the various aspects of human creativity, including the field of painting. To know the image of the soldier in contemporary Iraqi painting, the research included four chapters. The first chapter focused on the methodological framework of the research, while the second chapter included three sections. The first topic dealt with the philosophical and artistic concept of the image. The second topic was concerned with the representations of the soldier's image in

... Show More
View Publication Preview PDF
Crossref
Publication Date
Sat Apr 01 2023
Journal Name
Baghdad Science Journal
Detour Polynomials of Generalized Vertex Identified of Graphs

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
Wed Jan 01 2020
Journal Name
Italian Journal Of Pure And Applied Mathematics
The non-zero divisor graph of a ring

Scopus (5)
Scopus