DIFFERENCE SQUARE MEAN FUZZY LABELLING OF TREE RELATED GRAPHS

Abstract

A graph is said to be a mean square fuzzy graph if it is characterized by the number of edges that are the least significant of any two neighboring vertices. In this study, we focus on the mean square fuzzy labeling technique for newly constructed graphs generated by replacing each edge of balloon trees, shrub trees, banana trees, and coconut trees. These are examples of tree graphs.