Mini Tom

Learn More
In this paper the idea of sum distance which is a metric, in a fuzzy graph is introduced. The concepts of eccentricity, radius, diameter, center and self centered fuzzy graphs are studied using this metric. Some properties of eccentric nodes, peripheral nodes and central nodes are obtained. A characterization of self centered complete fuzzy graph is(More)
License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. Abstract In this note, we show by an example that the theorem stating all paths in a complete fuzzy graph are strongest paths, in the paper titled " Types of arcs in a fuzzy graph " by Mathew and Sunitha is not always true and(More)
In this paper we study strongest paths in a fuzzy graph. A necessary and sufficient condition for an arc in a fuzzy graph to be a strongest path and a sufficient condition for a path in a fuzzy graph to be a strongest path are obtained. A characterization of δ−arcs and the relationship between fuzzy cutnodes and δ−arcs are also obtained. Also a(More)
  • 1