Novel inequalities for generalized graph entropies – Graph energies and topological indices

Xueliang Li, Zhongmei Qin, Meiqin Wei, Ivan Gutman and Matthias Dehmer

Applied Mathematics and Computation, 2015, vol. 259, issue C, 470-479

Abstract: The entropy of a graph is an information-theoretic quantity for measuring the complexity of a graph. After Shannon introduced the entropy to information and communication, many generalizations of the entropy measure have been proposed, such as Rényi entropy and Daróczy entropy. In this article, we prove accurate connections (inequalities) between generalized graph entropies, graph energies, and topological indices. Additionally, we obtain some extremal properties of nine generalized graph entropies by employing graph energies and topological indices.

Keywords: Generalized graph entropies; Graph energies; Graph indices (search for similar items in EconPapers)
Date: 2015
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300315002520
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:259:y:2015:i:c:p:470-479

DOI: 10.1016/j.amc.2015.02.059

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