Domination in Plithogenic product fuzzy graphs

Abstract

Abstract The notion of Plithogenic vertex domination and Plithogenic edge domination in Plithogenic product fuzzy graphs (PPFGs) has been newly introduced and discussed based on P-weights of P-vertices and P-edges respectively with properties, results and examples. Plithogenic vertex domination number and Plithogenic edge domination number for a Plithogenic product fuzzy graph (PPFG), and the bounds and algorithms for and the maximum and minimum values and algorithms for the same are also investigatedthe same are also investigated. Perfect Plithogenic vertex domination and perfect Plithogenic edge domination are presented as special cases of Plithogenic vertex domination and Plithogenic edge domination respectively. It is observed that the P-vertex (P-edge) with the maximum P-weight exists in every Plithogenic vertex (edge) dominating set of a Plithogenic product fuzzy graph. The novelty in these ideas of domination is that a better perception of reality can be obtained through the analysis of both, Plithogenic vertex domination and Plithogenic edge domination, in any Plithogenic product fuzzy graphical structure.