Minimal degree-based graph entropy for dense graphs

DOI10.46793/MATCH94-3.24724MaRDI QIDQ6931853zbMATH OpenFDO

Authors Jingzhi Yan, Feng Guan

Publication date 10 September 2025

Published in MATCH - Communications in Mathematical and in Computer Chemistry (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.46793/MATCH94-3.24724

Mathematics Subject Classification ID

Density (toughness, etc.) (05C42) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Cites work

• A history of graph entropy measures
• A Mathematical Theory of Communication
• Extremality of degree-based graph entropies
• First degree-based entropy of graphs
• Graph Operations Decreasing Values of Degree-Based Graph Entropies
• scientific article; zbMATH DE number 7410277 (Why is no real title available?)
• Information processing in complex networks: Graph entropy and information functionals
• On extremal cacti with respect to the first degree-based entropy
• Resolution of Yan's conjecture on entropy of graphs
• Topological structure of extremal graphs on the first degree-based graph entropies

Cited in

(1)

• On the minimality of degree-based graph entropy for connected graphs

This page was built for publication: Minimal degree-based graph entropy for dense graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6931853)