The concept of neutrosophic sets can be utilized as a Mathematical tool to deal with imprecise and unspecified information. The neutrosophic set is a generalization of fuzzy sets and intutionistic fuzzy sets which is applied in Graph theory. The neutrosophic fuzzy graph is used in the problems, where the relation between vertices and hence edges are indeterminate.

The concepts of graph theory are applied in many areas of computer science including image segmentation, data mining, clustering, image capturing and networking. Fuzzy graph theory is successfully used in many problems, to handle the uncertainty that occurs in graph theory. A single valued neutrosophic graph (SVNG) is an instance of a neutrosophic graph and a generalization of the fuzzy graph, intuitionistic fuzzy graph, and interval-valued intuitionistic fuzzy graph. In this paper, the basic operations on SVNGs such as direct product, Cartesian product, semi-strong product, strong product, lexicographic product, union, ring sum and join are defined. Moreover, the degree of a vertex in SVNGs formed by these operations in terms of the degree of vertices in the given SVNGs in some particular cases are determined. Finally, an application of single valued neutrosophic digraph (SVNDG) in traval time is provided.

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. [10] and Shah-Hussain [18]. We also present an application of single-valued neutrosophic graphs in social network.

Fuzzy graph theory is a useful and well-known tool to model and solve many real-life optimization problems. Since real-life problems are often uncertain due to inconsistent and indeterminate information, it is very hard for an expert to model those problems using a fuzzy graph. A neutrosophic graph can deal with the uncertainty associated with the inconsistent and indeterminate information of any real-world problem, where fuzzy graphs may fail to reveal satisfactory results.

In this article, we combine the interval valued neutrosophic soft set and graph theory. We introduce the notions of interval valued neutrosophic soft graphs, strong interval valued neutrosophic graphs, complete interval valued neutrosophic graphs, and investigate some of their related properties. We study some operations on interval valued neutrosophic soft graphs.

Fuzzy graph theory plays an important role in the study of the symmetry and asymmetry properties of fuzzy graphs. With this in mind, in this paper, we introduce new neutrosophic graph called complex neutrosophic graphs of type 1 (abbr. CNG1). We then present a matrix representation for it and study some properties of this new concept.

Combining the single valued neutrosophic set with graph theory, a new graph model emerges, called single valued neutrosophic graph.