Article
Version 1
Preserved in Portico This version is not peer-reviewed
The Domination Entropy of The Graphs
Version 1
: Received: 23 October 2020 / Approved: 26 October 2020 / Online: 26 October 2020 (09:24:42 CET)
How to cite: Şahin, B. The Domination Entropy of The Graphs. Preprints 2020, 2020100507. https://doi.org/10.20944/preprints202010.0507.v1 Şahin, B. The Domination Entropy of The Graphs. Preprints 2020, 2020100507. https://doi.org/10.20944/preprints202010.0507.v1
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
Subject
Computer Science and Mathematics, Computer Vision and Graphics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
