On Graph Entropy Measures Based on the Number of Dominating and Power Dominating Sets

This article examines graph entropy measures that depend on the number of dominating and power-dominating sets. To quantify the structural complexity of a graph structure, one uses graph entropies. It is easy to compute these properties for smaller networks, and if reliable approximations are developed, similar metrics can also be used for larger graphs. Using various graph invariants, many graph entropy measures have already been established and computed. So, in this work, a new graph entropy measure, namely, power domination entropy, using the power domination polynomial, is introduced. The domination and power domination polynomials of graphs are used to determine the number of dominating and power dominating sets. Let D(G,ξ) represent the collection of all dominating sets of G with size ξ, dξ(G)=|D(G,ξ)|, and γs be the total number of dominating sets of G. Then, the domination entropy of G with n nodes is defined as Idom(G)=−∑ξ=1ndξ(G)γs(G) log(dξ(G)γs(G)). The domination and power domination entropies for a few graphs are further computed. Following that, a comparison between the domination and power domination entropies of several graphs is provided.