On extremal properties of general graph entropies

Abstract

Determining extremal values of graph entropies for some given classes of graphs is intricate, because there is a lack of analytical methods to tackle this particular problem. In this paper we apply the strong mixing variables method for this propose. We characterized the graphs which attain the minimum values of the graph entropy, based on an arbitrary increasing convex information functional, among certain classes of graphs, namely, trees, unicyclic graphs and bicyclic graphs. © 2018 University of Kragujevac, Faculty of Science. All rights reserved.