Degree−Based Entropy of Graphs

The first degree-based entropy of graphs is ainformation-theoretic quantity for measuring the structural information of graphs. In recent year these quantities found many applications in chemistry and so computing the maximum and minimum values of such type of entropies in some interesting classes of chemical graphs are important for chemists. In this paper by applying the majorization technique we extend some known results about the maximum and minimum values of the first degree-based entropy of trees, unicyclic and bicyclic graphs.