Affiliation:
1. Department of Computer Science and Engineering Faculty of Engineering and Technology Jamia Hamdard University Hamdard Nagar, New Delhi – 110062, India
Abstract
In this paper the author introduces the notion of Z-weighted graph or Z-graph in Graph Theory, considers the Shortest Path Problem (SPP) in a Z-graph. The classical Dijkstra’s algorithm to find the shortest path in graphs is not applicable to Z-graphs. Consequently the author proposes a new algorithm called by Z-Dijkstra's Algorithm with the philosophy of the classical Dijkstra's Algorithm to solve the SPP in a Z-graph.
Publisher
Oriental Scientific Publishing Company
Subject
General Earth and Planetary Sciences,General Environmental Science
Reference86 articles.
1. Abbasbandy, Saeid, Ranking of fuzzy numbers, some recent and new formulas, IFSA-EUSFLAT, 2009, Page 642- 646.
2. Abbasbandy, Saeid., Allahviranloo, T. and Saneifard, R., A Method for Ranking of Fuzzy Numbers using New Weighted Distance, Mathematical and Computational Applications, Vol. 16, No. 2, Page 359-369, 2011.
3. Balakrishnan, V. K.; Graph Theory, McGraw-Hill; 1997.
4. Bhutani,K.R. and Rosenfeld,A., Fuzzy End Nodes in Fuzzy Graphs, Information Sciences, Vol. 152 (2003) 323-326.
5. CrossRef