A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph

Abstract

Many extension and generalization of fuzzy sets have been studied and introduced in the literature. Hesitancy fuzzy digraph is a generalization of intuitionistic fuzzy set and fuzzy graph.  In this paper, we redefine some basic operations of hesitancy fuzzy graph and it is referred as hesitancy fuzzy digraph (in short HFDG). We discuss some arithmetic operations and relations among HFDG. We further proposed a method to solve a shortest path problem through score function.

Keywords

• Digraphs,Hesitancy fuzzy sets,Hesitancy fuzzy digraphs

References

1. [1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems vol. 20 (1986) 87-96.
2. [2] N. X. Thao, F. Smarandache, N. V. Dinh. Support-Neutrosophic Set: A New Concept in Soft Computing, Neutrosophic Sets and Systems 16 (2017) 93-98.
3. [3] L. Zadeh, Fuzzy sets, Inform and Control 8 (1965) 338-353
4. [4] F. Smarandache, A Unifying Field in Logics. Neutrosophic Logic: Neutrosophy, Neutrosophic Set, Neutrosophic Probability, Rehoboth: American Research Press (1999).
5. [5] M. Parimala, M. Karthika, S. Jafari, F. Smarandache, and R. Udhayakumar, Decision-Making via Neutrosophic Support Soft Topological Spaces, Symmetry 10(6) (2017) 1-10.
6. [6] A. Kau®man, Introduction a la Theorie des Sous-emsembles Flous, Masson et Cie 1 1973.
7. [7] S. Broumi, M. Talea, A. Bakali, and F. Smarandache, Single-valued neutrosophic graphs ,Journal of New Theory 10 (2016) 86-101.
8. [8] M. Akram and S. Shahzadi, Neutrosophic soft graphs with application, Journal of Intelligent and Fuzzy Systems 32 (2017) 841-858.

9. [9] M. Akram, S. Shahzadi, and S. Broumi, Single-valued neutrosophic hypergraphs, TWMS Journal of Applied and Engineering Mathematics 2016.