Resolution of Yan's conjecture on entropy of graphs

DOI10.46793/MATCH.89-2.389CMaRDI QIDQ5050774zbMATH OpenFDO

Authors Stijn Cambie, Matteo Mazzamurro

Publication date 17 November 2022

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

Full work available at URL https://arxiv.org/abs/2205.03357

Mathematics Subject Classification ID

Chemical graph theory (05C92) Entropy and other invariants (28D20) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Abstract: The first degree-based entropy of a graph is the Shannon entropy of its degree sequence normalized by the degree sum. In this paper, we characterize the connected graphs with given order $n$ and size $m$ that minimize the first degree-based entropy whenever $n-1lemle2n-3,$ thus extending and proving a conjecture by Yan.

Recommendations

• First degree-based entropy of graphs
• A note on extremality of the first degree-based entropy
• Topological structure of extremal graphs on the first degree-based graph entropies
• Extremality of degree-based graph entropies
• On the extremal values of general degree-based graph entropies

Cites work

• Bounds for degree-based network entropies
• Degree-based entropies of networks revisited
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Extremality of degree-based graph entropies
• First degree-based entropy of graphs
• Graphs with given cyclomatic number extremal relatively to vertex degree function index for convex functions
• scientific article; zbMATH DE number 6127695 (Why is no real title available?)
• Information processing in complex networks: Graph entropy and information functionals
• New upper bound and lower bound for degree-based network entropy
• On extremal properties of graph entropies
• On the extremal values of general degree-based graph entropies
• Seven criteria for integer sequences being graphic
• Topological structure of extremal graphs on the first degree-based graph entropies

Cited in

(8)

• First degree-based entropy of graphs
• A note on walk entropies in graphs
• A note on extremality of the first degree-based entropy
• Note on von Neumann and Rényi entropies of a graph
• Extremal values of degree-based entropies of bipartite graphs
• On the minimality of degree-based graph entropy for connected graphs
• On the main distance-based entropies: the eccentricity- and Wiener-entropy
• Minimal degree-based graph entropy for dense graphs

Describes a project that uses

Uses Software

• igraph

This page was built for publication: Resolution of Yan's conjecture on entropy of graphs

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