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: | Pingping Song, Haidar Ali, Muhammad Ahsan Binyamin, Bilal Ali, Jia-Bao Liu |
---|---|
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!
|
Similar Items
-
Eccentricity-Based Topological Descriptors of First Type of Hex-Derived Network
by: Usman Babar, et al.
Published: (2022-01-01) -
Multiplicative Topological Properties on Degree Based for Fourth Type of Hex-Derived Networks
by: Haidar Ali, et al.
Published: (2022-01-01) -
On Computation of Degree-Based Entropy of Planar Octahedron Networks
by: Tian-Le Sun, et al.
Published: (2022-01-01) -
Retracted: On Topological Properties of Degree-Based Entropy of Hex-Derived Network of Type 3
by: Journal of Function Spaces
Published: (2023-01-01) -
Vertex-Edge-Degree-Based Topological Properties for Hex-Derived Networks
by: Ali Ahmad, et al.
Published: (2022-01-01)