A Study of Independency on Fuzzy Resolving Sets of Labelling Graphs
Ramachandramoorthi Shanmugapriya,
Perichetla Kandaswamy Hemalatha,
Lenka Cepova,
Jiri Struz
Affiliations
Ramachandramoorthi Shanmugapriya
Department of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai 600062, India
Perichetla Kandaswamy Hemalatha
Department of Mathematics, Vel Tech Rangarajan Dr. Sagunthala R&D Institute of Science and Technology, Chennai 600062, India
Lenka Cepova
Department of Machining, Assembly and Engineering Metrology, Faculty of Mechanical Engineering, VSB-Technical University of Ostrava, 70800 Ostrava, Czech Republic
Jiri Struz
Department of Machine Parts and Mechanism, Faculty of Mechanical Engineering, VSB-Technical University of Ostrava, 70800 Ostrava, Czech Republic
Considering a fuzzy graph G is simple and can be connected and considered as a subset H=u1,σu1,u2,σu2,…uk,σuk, |H|≥2; then, every two pairs of elements of σ−H have a unique depiction with the relation of H, and H can be termed as a fuzzy resolving set (FRS). The minimal H cardinality is regarded as the fuzzy resolving number (FRN), and it is signified by FrG. An independence set is discussed on the FRS, fuzzy resolving domination set (FRDS), and Fuzzy modified antimagic resolving set (FMARS). In this paper, we discuss the independency of FRS and FMARS in which an application has also been developed.
