Submitted:
23 October 2020
Posted:
26 October 2020
You are already at the latest version
Abstract
Graph entropies have been used to interpret the complexity of the networks. There are various graph entropies in the literature. In this note a new graph entropy is defined which is based on the dominating sets of the graphs. Moreover the entropy of some classes of the graphs is obtained
Keywords:
Graph Entropy
; Domination
; Domination Polynomial
; Information Functional
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
