IDEAS home Printed from https://ideas.repec.org/a/hin/jnlmpe/7946936.html
   My bibliography  Save this article

Analysis of the Shortest Path in Spherical Fuzzy Networks Using the Novel Dijkstra Algorithm

Author

Listed:
  • Zafar Ullah
  • Huma Bashir
  • Rukhshanda Anjum
  • Salman A. AlQahtani
  • Suheer Al-Hadhrami
  • Abdul Ghaffar

Abstract

The concept of fuzzy graph (FG) and its generalized forms has been developed to cope with several real-life problems having some sort of imprecision like networking problems, decision making, shortest path problems, and so on. This paper is based on some developments in generalization of FG theory to deal with situation where imprecision is characterized by four types of membership grades. A novel concept of T-spherical fuzzy graph (TSFG) is proposed as a common generalization of FG, intuitionistic fuzzy graph (IFG), and picture fuzzy graph (PFG) based on the recently introduced concept of T-spherical fuzzy set (TSFS). The significance and novelty of proposed concept is elaborated with the help of some examples, graphical analysis, and results. Some graph theoretic terms are defined and their properties are studied. Specially, the famous Dijkstra algorithm is proposed in the environment of TSFGs and is applied to solve a shortest path problem. The comparative analysis of the proposed concept and existing theory is made. In addition, the advantages of the proposed work are discussed over the existing tools.

Suggested Citation

  • Zafar Ullah & Huma Bashir & Rukhshanda Anjum & Salman A. AlQahtani & Suheer Al-Hadhrami & Abdul Ghaffar, 2021. "Analysis of the Shortest Path in Spherical Fuzzy Networks Using the Novel Dijkstra Algorithm," Mathematical Problems in Engineering, Hindawi, vol. 2021, pages 1-15, September.
    • Handle: RePEc:hin:jnlmpe:7946936
    DOI: 10.1155/2021/7946936
    as

    Download full text from publisher

    File URL: http://downloads.hindawi.com/journals/MPE/2021/7946936.pdf
    Download Restriction: no
    File URL: http://downloads.hindawi.com/journals/MPE/2021/7946936.xml
    Download Restriction: no
    File URL: https://libkey.io/10.1155/2021/7946936?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:hin:jnlmpe:7946936. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Mohamed Abdelhakeem (email available below). General contact details of provider: https://www.hindawi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.