On Computation of Entropy of Hex-Derived Network
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. Hex-derived networks have a variety of important applications in medication store, hardware, and system administra...
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Hindawi-Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/9993504 |
| 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. Hex-derived networks have a variety of important applications in medication store, hardware, and system administration. In this article, we discuss hex-derived network of type 1 and 2, written as HDN 1n and HDN 2n, respectively of order n. We also compute some degree-based entropies such as Randić, ABC, and GA entropy of HDN 1n and HDN 2n. |
|---|---|
| ISSN: | 1099-0526 |