0001 | The Results on Vertex Domination in Fuzzy Graphs

We do fuzzification the concept of domination in crisp graph by using membership values of nodes, α-strong and arcs. In this paper, we introduce a new variation on the domination theme which we call vertex domination. We determine the vertex domination number γv for several classes of fuzzy graphs, specially complete fuzzy graph and complete bipartite fuzzy graphs. The bounds is obtained for the vertex domination number of fuzzy graphs. Also the relationship between M-strong arcs and α-strong is obtained. In fuzzy graphs, monotone decreasing property and monotone increasing property is introduced. We prove the vizing’s conjecture is monotone decreasing fuzzy graph property for vertex domination. we prove also the Grarier-Khelladi’s conjecture is monotone decreasing fuzzy graph property for it. We obtain Nordhaus-Gaddum (NG) type results for these parameters. The relationship between several classes of operations on fuzzy graphs with the vertex domination number of them is studied