On Computation of Entropy of Hex-Derived Network

Pingping Song, Daryanti Haidar (), Muhammad Ahsan Binyamin, Bilal Ali, Jia-Bao Liu and M. Irfan Uddin

Complexity, 2021, vol. 2021, 1-18

Abstract: 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.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/9993504.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/9993504.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:9993504

DOI: 10.1155/2021/9993504

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().