Graceful and magic labeling in special fuzzy graphs

Abstract

In this paper, we present an algorithm to find fuzzy labeling of a star graph K1,n, bi star graph Bn,n and double star graph K1,n,n. We prove that star graph K1,n at most 89 edges are fuzzy graceful iff it admits fuzzy magic graph. Also we prove that bi star graph Bn,n having at most 59 edges are fuzzy graceful iff it is a fuzzy bi magic graph.We prove that fuzzy labeled double star graph K1,n,n at most 30 edges is fuzzy graceful.