DETERMINING FUZZY LABELING OF A WHEEL GRAPH AND ITS STRONG FUZZY RESOLVING SET

Given a fuzzy set on , a graph is called a fuzzy labeling graph if and are bijective membership functions such that every vertex and edge receive a unique membership degree and satisfies for . A graph formed from a single vertex connected to the vertices of a cycle of length is called a wheel graph. In this research, an algorithm for fuzzy labeling of a wheel graph is constructed. We also examine the strong fuzzy resolving set (SFRS) of the fuzzy labeling wheel graph with vertices and get the strong resolving number .