Robust and minimum spanning tree in fuzzy environment
by Arindam Dey; Sahanur Mondal; Tandra Pal
International Journal of Computing Science and Mathematics (IJCSM), Vol. 10, No. 5, 2019

Abstract: This paper proposes an algorithm to find the fuzzy minimum spanning tree (FMST) of an undirected weighted fuzzy graph, in which mixed fuzzy numbers, either triangular or trapezoidal, are used to represent the lengths/costs of the arcs. In the proposed algorithm, we incorporate the uncertainty in Kruskal's algorithm for MST using fuzzy number as arc length. The concept of possibility programming is used to compare between the fuzzy number (i.e., costs of arcs) and addition operation of fuzzy numbers is used to find the cost of the spanning tree. We also investigate the robust version of the FMST problem. We define two measures for robustness of an FMST: absolute robustness and relative robustness. We characterize the fuzzy worst case scenarios for a given fuzzy spanning tree for both the measures. The corresponding fuzzy robust spanning trees are respectively defined as absolute robust fuzzy spanning tree (ARFST) and relative robust fuzzy spanning tree (RRFST). We extend Kruskal's algorithm to compute the ARFST and RRFST in fuzzy environment. An example of fuzzy graph is used to illustrate the effectiveness of the proposed methods.

Online publication date: Fri, 22-Nov-2019

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Computing Science and Mathematics (IJCSM):
Login with your Inderscience username and password:

    Username:        Password:         

Forgotten your password?


Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com