Preprint 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 (doi: 10.20944/preprints202010.0507.v1). Şahin, B. The Domination Entropy of The Graphs. Preprints 2020, 2020100507 (doi: 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

Subject Areas

Graph Entropy; Domination; Domination Polynomial; Information Functional

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our diversity statement.

Leave a public comment
Send a private comment to the author(s)
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.