Interval Valued Neutrosophic Soft Graphs

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. We also give an application of interval valued neutrosophic soft graphs into a decision making problem. We hold forth an algorithm to solve decision making problems by using interval valued neutrosophic soft graphs.

In this paper, we introduce the concept of interval-valued neutrosophic soft graphs and gave some new operations such as parametric ∧−intersection and parametric ∨−union on interval-valued neutrosophic soft graphs. We have also applied the concept of interval-valued neutrosophic soft graph in a decision making problem and then gave an algorithm for the selection of optimal object.

In this paper, we combine the concepts of interval-valued neutrosophic soft set and graph theory. We introduce notations of interval-valued neutrosophic soft graph and complete interval-valued neutrosophic soft graph. We also present several different types operations including cartesian product, union and intersection on interval-valued neutrosophic soft graphs and investigate some properties of them.

The notion of interval valued neutrosophic sets is a generalization of fuzzy sets, intuitionistic fuzzy sets, interval valued fuzzy sets, interval valued intuitionstic fuzzy sets and single valued neutrosophic sets. We apply for the first time to graph theory the concept of interval valued neutrosophic sets, an instance of neutrosophic sets. We introduce certain types of interval valued neutrosophc graphs (IVNG) and investigate some of their properties with proofs and examples.

The notion of interval valued neutrosophic sets is a generalization of fuzzy sets, intuitionistic fuzzy sets, interval valued fuzzy sets, interval valued intuitionstic fuzzy sets and single valued neutrosophicsets. We apply for the first time the concept of interval valued neutrosophic sets, an instance of neutrosophic sets, to the graph theory. We introduce certain types of interval valued signed neutrosophc graphs (IVNG) and investigate some of their properties with proof and example.

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.

In this paper, we introduce the concept of interval-valued neutrosophic soft graphs and gave some new operations such as parametric ∧−intersection and parametric ∨−union on interval-valued neutrosophic soft graphs. We have also applied the concept of interval-valued neutrosophic soft graph in a decision making problem and then gave an algorithm for the selection of optimal object.

In this paper, we discuss a subclass of interval valued neutrosophic graphs called strong interval valued neutrosophic graphs, which were introduced by Broumi et al. [41]. The operations of Cartesian product, composition, union and join of two strong interval valued neutrosophic graphs are defined. Some propositions involving strong interval valued neutrosophic graphs are stated and proved.