On the distance based graph entropies

DOI10.1016/j.amc.2015.07.100zbMath1410.05046OpenAlexW2215827254MaRDI QIDQ668715

Aleksandar Ilić, Matthias Dehmer

Publication date: 19 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2015.07.100

zbMATH Keywords

Jensen's inequalitydistancegraph entropyShannon's entropy

Mathematics Subject Classification ID

Distance in graphs (05C12) Measures of information, entropy (94A17)

Related Items (5)

Graph Operations Decreasing Values of Degree-Based Graph Entropies ⋮ On graph entropy measures based on the number of independent sets and matchings ⋮ Counterexamples to conjectures on graph distance measures based on topological indexes ⋮ On the extremal values of general degree-based graph entropies ⋮ First degree-based entropy of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalizations of Wiener polarity index and terminal Wiener index
• Extremality of degree-based graph entropies
• Information theory of networks
• A history of graph entropy measures
• A note on distance-based graph entropies
• On a certain distance between isomorphism classes of graphs
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph

This page was built for publication: On the distance based graph entropies