Nikfar Domination in Fuzzy Graphs
Keyword(s):
We introduce a new variation on the domination theme which we call nikfar domination as reducing waste of time in transportation planning. We determine the nikfar domination number v for several classes of fuzzy graphs. The bounds is obtained for it. We prove both of the Vizing's conjecture and the Grarier-Khelladi's conjecture are monotone decreasing fuzzy graph property for nikfar domination. We obtain Nordhaus-Gaddum (NG) type results for these parameters. Finally, we discuss about nikfar dominating set of a fuzzy tree by using the bridges and -strong edges equivalence.
Keyword(s):
Keyword(s):
Keyword(s):
Keyword(s):