Araştırma Makalesi
BibTex RIS Kaynak Göster

A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph

Yıl 2019, Sayı: 27, 52 - 62, 01.03.2019

Öz

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.

Kaynakça

  • [1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems vol. 20 (1986) 87-96.
  • [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] L. Zadeh, Fuzzy sets, Inform and Control 8 (1965) 338-353
  • [4] F. Smarandache, A Unifying Field in Logics. Neutrosophic Logic: Neutrosophy, Neutrosophic Set, Neutrosophic Probability, Rehoboth: American Research Press (1999).
  • [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] A. Kau®man, Introduction a la Theorie des Sous-emsembles Flous, Masson et Cie 1 1973.
  • [7] S. Broumi, M. Talea, A. Bakali, and F. Smarandache, Single-valued neutrosophic graphs ,Journal of New Theory 10 (2016) 86-101.
  • [8] M. Akram and S. Shahzadi, Neutrosophic soft graphs with application, Journal of Intelligent and Fuzzy Systems 32 (2017) 841-858.
  • [9] M. Akram, S. Shahzadi, and S. Broumi, Single-valued neutrosophic hypergraphs, TWMS Journal of Applied and Engineering Mathematics 2016.
Yıl 2019, Sayı: 27, 52 - 62, 01.03.2019

Öz

Kaynakça

  • [1] K. Atanassov, Intuitionistic fuzzy sets, Fuzzy Sets and Systems vol. 20 (1986) 87-96.
  • [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] L. Zadeh, Fuzzy sets, Inform and Control 8 (1965) 338-353
  • [4] F. Smarandache, A Unifying Field in Logics. Neutrosophic Logic: Neutrosophy, Neutrosophic Set, Neutrosophic Probability, Rehoboth: American Research Press (1999).
  • [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] A. Kau®man, Introduction a la Theorie des Sous-emsembles Flous, Masson et Cie 1 1973.
  • [7] S. Broumi, M. Talea, A. Bakali, and F. Smarandache, Single-valued neutrosophic graphs ,Journal of New Theory 10 (2016) 86-101.
  • [8] M. Akram and S. Shahzadi, Neutrosophic soft graphs with application, Journal of Intelligent and Fuzzy Systems 32 (2017) 841-858.
  • [9] M. Akram, S. Shahzadi, and S. Broumi, Single-valued neutrosophic hypergraphs, TWMS Journal of Applied and Engineering Mathematics 2016.
Toplam 9 adet kaynakça vardır.

Ayrıntılar

Birincil Dil İngilizce
Konular Matematik
Bölüm Araştırma Makalesi
Yazarlar

Parimala Mani Bu kişi benim

Said Broumi

Karthika Muthusamy Bu kişi benim

Yayımlanma Tarihi 1 Mart 2019
Gönderilme Tarihi 3 Eylül 2018
Yayımlandığı Sayı Yıl 2019 Sayı: 27

Kaynak Göster

APA Mani, P., Broumi, S., & Muthusamy, K. (2019). A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph. Journal of New Theory(27), 52-62.
AMA Mani P, Broumi S, Muthusamy K. A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph. JNT. Mart 2019;(27):52-62.
Chicago Mani, Parimala, Said Broumi, ve Karthika Muthusamy. “A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph”. Journal of New Theory, sy. 27 (Mart 2019): 52-62.
EndNote Mani P, Broumi S, Muthusamy K (01 Mart 2019) A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph. Journal of New Theory 27 52–62.
IEEE P. Mani, S. Broumi, ve K. Muthusamy, “A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph”, JNT, sy. 27, ss. 52–62, Mart 2019.
ISNAD Mani, Parimala vd. “A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph”. Journal of New Theory 27 (Mart 2019), 52-62.
JAMA Mani P, Broumi S, Muthusamy K. A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph. JNT. 2019;:52–62.
MLA Mani, Parimala vd. “A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph”. Journal of New Theory, sy. 27, 2019, ss. 52-62.
Vancouver Mani P, Broumi S, Muthusamy K. A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph. JNT. 2019(27):52-6.


TR Dizin 26024

Electronic Journals Library (EZB) 13651



Academindex 28993

SOBİAD 30256                                                   

Scilit 20865                                                  


29324 As of 2021, JNT is licensed under a Creative Commons Attribution-NonCommercial 4.0 International Licence (CC BY-NC).