Open AccessSome Results On The N —Fuzzy Domination in Fuzzy Graphs
Author(s) -
Hayder J. Yousif,
Ahmed A. Omran
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1879/3/032009
Subject(s) - mathematics , fuzzy logic , combinatorics , fuzzy number , discrete mathematics , fuzzy subalgebra , bipartite graph , path (computing) , fuzzy set , graph , computer science , artificial intelligence , programming language
The purpose of this work is to introduce a new fuzzy domination parameter in fuzzy graphs G f = ( η, ρ ) it is called a ( N – fuzzy domination number) denoted by γ N ( G f ). Some properties and boundaries of this definition are introduced. The N – fuzzy domination number of fuzzy certain graphs as fuzzy complete, path, star, cycle, complete bipartite, and star are determined. Additionally the relation between the N-degrees of the vertices and the number of edges and N-edges of a fuzzy graph is discussedgraph discussed, with some suitable graphs and examples are given.