Statistics and Calculation of Entropy of Dominating David Derived Networks
A graph’s entropy is a functional one, based on both the graph itself and the distribution of probability on its vertex set. In the theory of information, graph entropy has its origins. Dominating David derived networks have a variety of important applications in medication store, hardware, and syst...
Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/9952481 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | A graph’s entropy is a functional one, based on both the graph itself and the distribution of probability on its vertex set. In the theory of information, graph entropy has its origins. Dominating David derived networks have a variety of important applications in medication store, hardware, and system administration. In this study, we discuss dominating David derived network of type 1, 2, and 3 written as D1n, D2n, and D3n, respectively of order n. We also compute some degree-based entropies such as Randić, ABC, and GA entropy of D1n, D2n, and D3n. |
|---|---|
| ISSN: | 1076-2787 1099-0526 |