A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph

Home Page
About
Submit A Journal
Submit A Conference
Submit Paper/Book
- Submit a Preprint
- Submit a Book
Contact

Journal of New Theory
Issue:27
A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph

A Network Shortest Path Algorithm via Hesitancy Fuzzy Digraph

Authors : Parimala Mani, Said Broumi, Karthika Muthusamy

Pages : 52-62

View : 14 | Download : 10

Publication Date : 2019-03-01

Article Type : Research Paper

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 insert ignore into journalissuearticles values(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

ORIGINAL ARTICLE URL

VIEW PAPER (PDF)

* There may have been changes in the journal, article,conference, book, preprint etc. informations. Therefore, it would be appropriate to follow the information on the official page of the source. The information here is shared for informational purposes. IAD is not responsible for incorrect or missing information.

Index of Academic Documents
İzmir Academy Association
CopyRight © 2023-2025