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...
Saved in:
| Main Authors: | , , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Wiley
2021-01-01
|
| Series: | Complexity |
| Online Access: | http://dx.doi.org/10.1155/2021/9993504 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1832554100658536448 |
|---|---|
| author | Pingping Song Haidar Ali Muhammad Ahsan Binyamin Bilal Ali Jia-Bao Liu |
| author_facet | Pingping Song Haidar Ali Muhammad Ahsan Binyamin Bilal Ali Jia-Bao Liu |
| author_sort | Pingping Song |
| collection | DOAJ |
| description | 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. |
| format | Article |
| id | doaj-art-986eab93135d43aea734c64298b233cd |
| institution | Kabale University |
| issn | 1076-2787 1099-0526 |
| language | English |
| publishDate | 2021-01-01 |
| publisher | Wiley |
| record_format | Article |
| series | Complexity |
| spelling | doaj-art-986eab93135d43aea734c64298b233cd2025-02-03T05:52:27ZengWileyComplexity1076-27871099-05262021-01-01202110.1155/2021/99935049993504On Computation of Entropy of Hex-Derived NetworkPingping Song0Haidar Ali1Muhammad Ahsan Binyamin2Bilal Ali3Jia-Bao Liu4Office of Teaching Supervision and Quality Assurance, Wuhu Institute of Technology, Wuhu 241006, Anhui, ChinaDepartment of Mathematics, Government College University, Faisalabad, PakistanDepartment of Mathematics, Government College University, Faisalabad, PakistanDepartment of Mathematics, Government College University, Faisalabad, PakistanSchool of Mathematics and Physics, Anhui Jianzhu University, Hefei 230601, ChinaA 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.http://dx.doi.org/10.1155/2021/9993504 |
| spellingShingle | Pingping Song Haidar Ali Muhammad Ahsan Binyamin Bilal Ali Jia-Bao Liu On Computation of Entropy of Hex-Derived Network Complexity |
| title | On Computation of Entropy of Hex-Derived Network |
| title_full | On Computation of Entropy of Hex-Derived Network |
| title_fullStr | On Computation of Entropy of Hex-Derived Network |
| title_full_unstemmed | On Computation of Entropy of Hex-Derived Network |
| title_short | On Computation of Entropy of Hex-Derived Network |
| title_sort | on computation of entropy of hex derived network |
| url | http://dx.doi.org/10.1155/2021/9993504 |
| work_keys_str_mv | AT pingpingsong oncomputationofentropyofhexderivednetwork AT haidarali oncomputationofentropyofhexderivednetwork AT muhammadahsanbinyamin oncomputationofentropyofhexderivednetwork AT bilalali oncomputationofentropyofhexderivednetwork AT jiabaoliu oncomputationofentropyofhexderivednetwork |