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.
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.
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.
This book addresses single-valued neutrosophic graphs and their applications. In addition, it introduces readers to a number of central concepts, including certain types of single-valued neutrosophic graphs, energy of single-valued neutrosophic graphs, bipolar single-valued neutrosophic planar graphs, isomorphism of intuitionistic single-valued neutrosophic soft graphs, and single-valued neutrosophic soft rough graphs. Divided into eight chapters, the book seeks to remedy the lack of a mathematical approach to indeterminate and inconsistent information. Chap. 1 presents a concise review of single-valued neutrosophic sets, while Chap. 2 explains the notion of neutrosophic graph structures and explores selected properties of neutrosophic graph structures. Chap. 3 discusses specific bipolar neutrosophic graphs. Chap. 4 highlights the concept of interval-valued neutrosophic graphs, while Chap. 5 presents certain notions concerning interval-valued neutrosophic graph structures. Chap. 6 addresses the concepts of rough neutrosophic digraphs and neutrosophic rough digraphs. Chap. 7 focuses on the concepts of neutrosophic soft graphs and intuitionistic neutrosophic soft graphs, before Chap. 8 rounds out the book by considering neutrosophic soft rough graphs.
The interval valued neutrosophic graphs are generalizations of the fuzzy graphs, interval fuzzy graphs, interval valued intuitionstic fuzzy graphs, and single valued neutrosophic graphs. Previously, several results have been proved on the isolated graphs and the complete graphs. In this paper, a necessary and sufficient condition for an interval valued neutrosophic graph to be an isolated interval valued neutrosophic graph is proved.
Blockchain Technology (BCT) is a growing and reliable technology in various fields such as developing business deals, economic environments, social and politics as well. Without having a trusted central party this technology, gives the guarantee for safe and reliable transactions using Bitcoin or Ethereum. In this paper BCT has been considered using Bitcoins. Also Blockchain Single and Interval Valued Neutrosophic Graphs have been proposed and applied in transaction of Bitcoins. Also degree, total degree, minimum and maximum degree have been found for the proposed graphs. Further, comparative analysis is done with advantages and limitations of different types of Blockchain graphs.
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.