A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is
This paper extends the fuzzy labeling concept to fuzzy tree and the resultant graph is called as fuzzy labeling tree. Different properties of fuzzy labeling trees are discussed and also bipartite fuzzy labeling graph is defined and some of its properties are discussed. It contains an algorithm for finding the fuzzy spanning subgraph F of a fuzzy labeling tree G, such that G * is complete and also the same algorithm can be used for finding the maximum spanning, strong arcs and fuzzy bridges ofdoi:10.12732/ijpam.v90i2.3 fatcat:exrfxoyllfeh7fsgxdxlhwibla