The concept of neutrosophic sets can be utilized as a mathematical tool to deal with imprecise and unspecified information. In this paper, we apply the concept of single-valued neutrosophic sets to graphs. We introduce the notion of single-valued neutrosophic graphs, and present some fundamental operations on single-valued neutrosophic graphs. We explore some interesting properties of single-valued neutrosophic graphs by level graphs. We highlight some flaws in the definitions of Broumi et al.  and Shah-Hussain . We also present an application of single-valued neutrosophic graphs in social network.
Comments: 26 Pages.
[v1] 2017-06-13 00:49:16
Unique-IP document downloads: 23 times
Vixra.org is a pre-print repository rather than a journal. Articles hosted may not yet have been verified by peer-review and should be treated as preliminary. In particular, anything that appears to include financial or legal advice or proposed medical treatments should be treated with due caution. Vixra.org will not be responsible for any consequences of actions that result from any form of use of any documents on this website.
Add your own feedback and questions here:
You are equally welcome to be positive or negative about any paper but please be polite. If you are being critical you must mention at least one specific error, otherwise your comment will be deleted as unhelpful.