Power Edge Domination Number of Chemical Structure of Acids in Daily Life

Abstract

For a graph  with size , and for any edge , a set  is said to be an power edge dominating set of graph  if each edge  is dominated by the following rules: (i) an edgein  is in power edge dominating set (in short PEDS), then it dominates itself and dominates all the adjacent edges of (ii) an observed edge  in  has  > 1 adjacent edges and if  – 1 of these edges are observed earlier, then the remaining non- observed edge is also observed by . The minimum cardinality of a power edge domination number of  is denoted by (). In this paper we investigate the power edge domination number for certain acids in our daily life.

For a graph  with size , and for any edge , a set  is said to be an power edge dominating set of graph  if each edge  is dominated by the following rules: (i) an edgein  is in power edge dominating set (in short PEDS), then it dominates itself and dominates all the adjacent edges of (ii) an observed edge  in  has  > 1 adjacent edges and if  – 1 of these edges are observed earlier, then the remaining non- observed edge is also observed by . The minimum cardinality of a power edge domination number of  is denoted by (). In this paper we investigate the power edge domination number for certain acids in our daily life.