Abstract
In this paper, by considering the concept of hesitancy fuzzy magic labeling of a graph, we show that whether any simple graph is hesitancy fuzzy magic labelizing. For this we prove that, any finite path graph, cyclic graph, star graph and by using them, any complete graph and so any connected graph has hesitancy fuzzy magic labelizing. Finally, we give some applications for hesitancy fuzzy magic labeling graphs in plumbing system and traffic flow.
Get full access to this article
View all access options for this article.
