FUZZY STEINER μ DIMENSION AND EMBEDDING THEOREM

Abstract

For a connected fuzzy graph G, the Steiner µ-distance of any two nodes of a non-empty set S ⊆ V (G) is defined as the minimum of sum of reciprocals of arc weights of minimum connected fuzzy sub graphs containing S. These fuzzy sub graphs are called fuzzy Steiner trees for S. In this article fuzzy Steiner µ Dimension is introduced and its properties are analysed.