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.
Birincil Dil | İngilizce |
---|---|
Konular | Matematik |
Bölüm | Araştırma Makalesi |
Yazarlar | |
Yayımlanma Tarihi | 1 Mart 2019 |
Gönderilme Tarihi | 3 Eylül 2018 |
Yayımlandığı Sayı | Yıl 2019 Sayı: 27 |
As of 2021, JNT is licensed under a Creative Commons Attribution-NonCommercial 4.0 International Licence (CC BY-NC). |