Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Nikfar Domination in Neutrosophic Graphs

Version 1 : Received: 31 December 2018 / Approved: 3 January 2019 / Online: 3 January 2019 (13:46:43 CET)

How to cite: Nikfar, M. Nikfar Domination in Neutrosophic Graphs. Preprints 2019, 2019010025. https://doi.org/10.20944/preprints201901.0025.v1 Nikfar, M. Nikfar Domination in Neutrosophic Graphs. Preprints 2019, 2019010025. https://doi.org/10.20944/preprints201901.0025.v1

Abstract

Many various using of this new-born fuzzy model for solving real-world problems and urgent requirements involve introducing new concept for analyzing the situations which leads to solve them by proper, quick and ecient method based on statistical data. This gap between the model and its solution cause that we introduce nikfar domination in neutrosophic graphs as creative and e ective tool for studying a few selective vertices of this model instead of all ones by using special edges. Being special selection of these edges a ect to achieve quick and proper solution to these problems. Domination hasn't ever been introduced. So we don't have any comparison with another de nitions. The most used graphs which have properties of being complete, empty, bipartite, tree and like stu and they also achieve the names for themselves, are studied as fuzzy models for getting nikfar dominating set or at least becoming so close to it. We also get the relations between this special edge which plays main role in doing dominating with other special types of edges of graph like bridges. Finally, the relation between this number with other special numbers and characteristic of graph like order are discussed.

Keywords

Neutrosophic graph, bridge, tree, e ective edge, nikfar domination.

Subject

Computer Science and Mathematics, Computer Vision and Graphics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.