Public Article
-
verified
A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph
ISSN: 2149 - 1402Publisher: author   
A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph
Indexed in
Science General
ARTICLE-FACTOR
1.3
Article Basics Score: 3
Article Transparency Score: 2
Article Operation Score: 3
Article Articles Score: 2
Article Accessibility Score: 2
SUBMIT PAPER ASK QUESTION
International Category Code (ICC):
ICC-1402
Publisher: Journal Of New Theory Naim Çağman
International Journal Address (IAA):
IAA.ZONE/214976701402
eISSN
:
2149 - 1402
VALID
ISSN Validator
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.