Szeged-like entropies of graphs

DOI10.1016/j.amc.2022.127325OpenAlexW4283822193MaRDI QIDQ2152724

Matthias Dehmer, Niko Tratnik, Frank Emmert-Streib, Petra Žigert Pleteršek

Publication date: 11 July 2022

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

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

zbMATH Keywords

quotient graphscut methodMostar entropyPI entropysensitivity of a topological descriptorSzeged entropy

Mathematics Subject Classification ID

Applications of graph theory (05C90) Distance in graphs (05C12) Measures of information, entropy (94A17) Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Chemical graph theory (05C92)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A history of graph entropy measures
• Information processing in complex networks: Graph entropy and information functionals
• Mostar index
• First degree-based entropy of graphs
• Quantitative Graph Theory
• Network entropy using edge-based information functionals

This page was built for publication: Szeged-like entropies of graphs