Abstract
ABSTRACT 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 [25] and Levi [21] by definition minimal size connected tree sub graph 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 sub network that uses the fewest communication links. In this paper, we extend Steiner distance SWk (G) for m-polar fuzzy graphs and give this parameter for Join, composition and Cartesian product of two m-polar fuzzy graphs.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
