Degree-based entropies of networks revisited

Shujuan Cao and Matthias Dehmer

Applied Mathematics and Computation, 2015, vol. 261, issue C, 141-147

Abstract: Studies on the information content of graphs and networks have been initiated in the late fifties based on the seminal work due to Shannon and Rashevsky. Various graph parameters have been used for the construction of entropy-based measures to characterize the structure of complex networks. Based on Shannon’s entropy, in Cao et al. (Extremality of degree-based graph entropies, Inform. Sci. 278 (2014) 22–33), we studied graph entropies which are based on vertex degrees by using so-called information functionals. As a matter of fact, there has been very little work to find their extremal values when considered Shannon entropy-based graph measures. We pursue with this line of research by proving further extremal properties of the degree-based graph entropies.

Keywords: Entropy; Shannon’s entropy; Graph entropy; Degree powers (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (8)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315003604
Full text for ScienceDirect subscribers only

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:eee:apmaco:v:261:y:2015:i:c:p:141-147

DOI: 10.1016/j.amc.2015.03.046

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().