Note on “Edge Geodesic Number of a Fuzzy Graph”

A strong path P from a to b is said to be geodesic if, for a connected fuzzy graph (FG) \(G:(V,\sigma ,\mu )\) , it is the shortest strong path from a to b. Let S be a set of vertices in the connected non-trivial FG. The edge geodesic closure of S is thus defined as the collection of all edges that lie on the geodesic between \(S's\) vertices, and it is represented as \((S)_e\) . In the article, “Edge geodesic number of a fuzzy graph” by Rehmani and Sunitha [6] published in Journal of Intelligent & Fuzzy Systems, Volume 37, Issue-3 (2019), pp. 4273–4286, Sects. 4.5, 4.6, and 4.7 contain some errors. In this note, we have pointed out the errors of these sections and the updated versions of these sections have been presented in this paper.