M. E. A. Tom

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
In this paper the idea of strong sum distance which is a metric, in a fuzzy graph is introduced. Based on this metric the concepts of eccentricity, radius, diameter, center and self centered fuzzy graphs are studied. Some properties of eccentric nodes, peripheral nodes and central nodes are obtained. A characterisation of self centered complete fuzzy graph(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)
Abstract. 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(More)
Spline function of degreem, deficiencyJ−1, i. e. inC m−J , are used in conjunction with (Gaussian) quadrature rules to construct algorthms for the numerical solution of a general Volterra integral equation of the second kind. For a givenm, the method is of order (m+1) and, in general, requires 0(N) evaluations of the kernel. This is in sharp contrast to the(More)
  • 1