Download Free Interval Valued Signed Neutrosophic Graph Book in PDF and EPUB Free Download. You can read online Interval Valued Signed Neutrosophic Graph and write the review.

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 research article, we introduce certain notions of interval-valued neutrosophic graph structures. We elaborate the concepts of interval-valued neutrosophic graph structures with examples.
Broumi et al. [15] proposedthe concept of interval-valued neutrosophic graphs. In this research article, we first show that there are some flaws in Broumi et al. [15] ’s definition, which cannot be applied in network models. We then modify the definition of an interval-valued neutrosophic graph. Further, we present some operations on interval-valued neutrosophic graphs. Moreover, we discuss the concepts of self-complementary and self weak complementary interval-valued neutrosophic complete graphs. Finally, we describe regularity of interval-valued neutrosophic graphs.
This book presents the advancements and applications of neutrosophics, which are generalizations of fuzzy logic, fuzzy set, and imprecise probability. The neutrosophic logic, neutrosophic set, neutrosophic probability, and neutrosophic statistics are increasingly used in engineering applications (especially for software and information fusion), medicine, military, cybernetics, physics.In the last chapter a soft semantic Web Services agent framework is proposed to facilitate the registration and discovery of high quality semantic Web Services agent. The intelligent inference engine module of soft semantic Web Services agent is implemented using interval neutrosophic logic.
Studies to neutrosophic graphs happens to be not only innovative and interesting, but gives a new dimension to graph theory. The classic coloring of edge problem happens to give various results. Neutrosophic tree will certainly find lots of applications in data mining when certain levels of indeterminacy is involved in the problem. Several open problems are suggested.
We first introduce the concept of interval-valued neutrosophic competition graphs. We then discuss certain types, including k-competition interval-valued neutrosophic graphs, p-competition interval-valued neutrosophic graphs and m-step interval-valued neutrosophic competition graphs. Moreover, we present the concept of m-step interval-valued neutrosophic neighbouhood graphs.
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.
Combining the single valued neutrosophic set with graph theory, a new graph model emerges, called single valued neutrosophic graph.
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.