Article
Version 1
Preserved in Portico This version is not peer-reviewed
Nikfar Domination in Fuzzy Graphs
Version 1
: Received: 31 December 2018 / Approved: 3 January 2019 / Online: 3 January 2019 (13:43:25 CET)
Version 2 : Received: 28 April 2019 / Approved: 7 May 2019 / Online: 7 May 2019 (10:14:31 CEST)
Version 3 : Received: 13 May 2019 / Approved: 14 May 2019 / Online: 14 May 2019 (09:50:12 CEST)
Version 2 : Received: 28 April 2019 / Approved: 7 May 2019 / Online: 7 May 2019 (10:14:31 CEST)
Version 3 : Received: 13 May 2019 / Approved: 14 May 2019 / Online: 14 May 2019 (09:50:12 CEST)
How to cite: Nikfar, M. Nikfar Domination in Fuzzy Graphs. Preprints.org 2019, 2019010024. https://doi.org/10.20944/preprints201901.0024.v1 Nikfar, M. Nikfar Domination in Fuzzy Graphs. Preprints.org 2019, 2019010024. https://doi.org/10.20944/preprints201901.0024.v1
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
fuzzy graph, fuzzy bridge, -strong edge, nikfar domination, dynamic networks
Subject
Computer Science and Mathematics, Computer Vision and Graphics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)