Reliability Measures in Neutrosophic Soft Graphs

Abstract

This paper introduces the concept of reliable nodes in neutrosophic soft graphs by evaluating path-based parameters. A reliable node is defined as one which is least susceptible to changes that are quantized by the indeterminacy and falsity values in a neutrosophic tuple. A new path measure called farness and three novel reliability measures which make use of the same are presented. Farness is defined in terms of a novel score function. The first, proximity reliability of a
node, computes the farness of a node to its neighbours. The second, intermediate reliability of a node, computes the fraction of paths of minimal farness that pass through it. The third, crisis reliability of a node, is a hybrid of the two previously defined. It considers the farness of a node to its neighbours taking into account the farness of the neighbours to other nodes in the graph.