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 administration. In this article, we discuss hex-derived network of type 1 and 2, written as HDN 1 n and HDN 2 n , respectively of order n . We also compute some degree-based entropies such as Randić, ABC , and G A entropy of HDN 1 n and HDN 2 n .
2019 ◽
Vol 57
(2)
◽
pp. 103-111
1974 ◽
Vol 32
◽
pp. 198-199
1978 ◽
Vol 36
(1)
◽
pp. 658-659
1987 ◽
Vol 45
◽
pp. 242-243
1989 ◽
Vol 47
◽
pp. 848-849
1996 ◽
Vol 21
(2)
◽
pp. 170-171