Statistics and Calculation of Entropy of Dominating David Derived Networks

Xuemei Zhao, Haidar Ali, Bilal Ali, Muhammad Ahsan Binyamin, Jia-Bao Liu, Ali Raza and Huihua Chen

Complexity, 2021, vol. 2021, 1-15

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. Dominating David derived networks have a variety of important applications in medication store, hardware, and system administration. In this study, we discuss dominating David derived network of type 1, 2, and 3 written as D1n, D2n, and D3n, respectively of order n. We also compute some degree-based entropies such as Randić, ABC, and GA entropy of D1n, D2n, and D3n.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/9952481.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/9952481.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:9952481

DOI: 10.1155/2021/9952481

Access Statistics for this article

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