On the distance based graph entropies

Aleksandar Ilić and Matthias Dehmer

Applied Mathematics and Computation, 2015, vol. 269, issue C, 647-650

Abstract: In this note we prove a sharp upper bound for the distance based graph entropy introduced in Chen et al. (2014). Furthermore we resolve one part of the conjecture proposed in the same paper and provide counterexamples for the other part.

Keywords: Shannon’s entropy; Graph entropy; Distance; Jensen’s inequality (search for similar items in EconPapers)
Date: 2015
References: View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031501022X
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:269:y:2015:i:c:p:647-650

DOI: 10.1016/j.amc.2015.07.100

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 ().