Find in Library

This paper investigates the inverse of the maximum result obtained by multiplying two unique graph types known as neutrosophic graphs. The main goal is to comprehend a point’s degree in the opposite situation of a neutrosophic graph’s maximum product. The study deals with two particular graph kinds and offers several conclusions and evidence regarding the opposite of the highest product. The research also contains a practical application of these ideas by locating an online streaming service utilizing a neutrosophic graph and a technique known as normalized Hamming distance and normalized Euclidean distance. Finally, the comparison results are given.