You are currently viewing a beta version of our website. If you spot anything unusual, kindly let us know.

Preprint
Article

Nikfar Domination in Fuzzy Graphs

Altmetrics

Downloads

1013

Views

856

Comments

0

This version is not peer-reviewed

Submitted:

31 December 2018

Posted:

03 January 2019

Withdrawn:

Invalid date

Read the latest preprint version here

Alerts
Abstract
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.
Keywords: 
Subject: Computer Science and Mathematics  -   Computer Vision and Graphics
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2024 MDPI (Basel, Switzerland) unless otherwise stated