| Summary: | Integrity for crisp graph theory is a well-defined topic. However, the integrity concept for fuzzy graphs has only recently been defined and extensively researched. However, in <i>m</i>-polar fuzzy graphs (<i>m</i>PFG), each node as well as edges has <i>m</i> components. So, defining integrity in the <i>m</i>PF environment needs a new concept. As in the <i>m</i>-polar fuzzy environment, each node and edge has <i>m</i> components, so we have more flexibility to address the uncertainty rather than fuzzy as well as other uncertain environments. In this article, we developed a brand-new idea known as node integrity on <i>m</i>PFG and went in-depth on a few of their related properties. We have thoroughly covered some of their related properties as well as a brand-new idea called dominating integrity on <i>m</i>PFG. Different types of integrity on <i>m</i>PFG such as node integrity, dominating integrity, and edge integrity are discussed thoroughly along with some of its interesting facts have been introduced. Under isomorphism, their properties have also been studied. We also discussed the interrelation between them. A new type of <i>m</i>PFG called efficient <i>m</i>PFG which is directly related to dominating integrity concept has also been introduced. Several facts about efficient <i>m</i>PFG have also been studied here along with details descriptions. Finally, a real-world mobile network application that is directly related to the integrity of the <i>m</i>PFG concept has been discussed.
|
|---|