Connected Graphs are Hesitancy Fuzzy Magic Labelizing Graphs
کد مقاله : 1067-CFIS (R1)
نویسندگان:
مجید فتح علیان *1، رجبعلی برزویی2، محمد حمیدی3
1مرکز تحصیلات تکمیلی دانشگاه بیام نور تهران
2دانشگاه شهید بهشتی
3عضو هییت علمی رسمی دانشگاه پیام نور کاشان
چکیده مقاله:
The study of labeling graphs exposed to various distance constraints is motivated by the problem of minimizing the span of non-interfering frequencies assigned to radio transmitters. However, hesitancy
fuzzy labeling models yield more precision, flexibility and compatibility to the system compared to the classical models. The present study aimed to show whether any simple graph is hesitancy fuzzy magic labelizing, by considering the concept of hesitancy fuzzy magic labeling of graphs. 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.
کلیدواژه ها:
(Hesitancy) fuzzy magic labeling graph, Magic Graph, Level subsets.
وضعیت : مقاله پذیرفته شده است