UNIFY STEINER WEINER DISTANCE FOR SOME CLASS OF m-POLAR FUZZY GRAPHS

Sometimes information in a network model is based on multi-agent, multi-attribute, multi-object, multi-polar information or uncertainty rather than a single bit. An m−polar fuzzy model is useful for such network models which gives more and more precision, flexibility, and comparability to the system as compared to the classical, fuzzy models. On the other, The Steiner tree problem in networks, and particularly in graphs, was formulated by Hakimi and Levi by definition minimal size connected tree subgraph that contains the vertices in S. Steiner trees have applications to multiprocessor computer networks. For example it may be desired to connect a certain set of processors with a subnetwork that uses the fewest communication links. In this paper we extend Steiner distance 〖SW〗_k(G) for m−polar fuzzy graphs and give this parameter for Join, Composition and Cartesian Product of two m−polar fuzzy graphs.