Applications of Neutrosophic social network using max product networks

Abstract

Neutrosophic graphs deals with more complex, uncertain problems in real-life applications which provides more flexibility and compatibility than intuitionistic fuzzy graphs. The aim of this paper is to enrich the efficiency of the maximized network in accordance with time management and quality. Here we maximize three neutrosophic graphs into a fully connected Neutrosophic network using the Max product of graphs. Such a type of network is formed from individuals with unique aspects in every field of work among them. This study proposes the max product of three graphs and forming a single-valued neutrosophic graph to find the efficient time management in the flow of information on a single source time-dependent network of single-valued neutrosophic network. The proposed approach is illustrated with applications. Also, a spanning tree algorithm comparative study is done with Said Broumi et al. [15] and enhanced the result by minimum score function.