Background
Type: Article

First degree-based entropy of graphs

Journal: Journal of Applied Mathematics and Computing (15985865)Year: 15 February 2019Volume: 59Issue: Pages: 37 - 46
Ghalavand A.Eliasi M.aAshrafi A.R.
a :University of Isfahan - IRAN(IR) - Isfahan
DOI:10.1007/s12190-018-1168-xLanguage: English

Abstract

The first degree-based entropy of a connected graph G is defined as: I1(G)=log(∑vi∈V(G)deg(vi))-∑vj∈V(G)deg(vj)logdeg(vj)∑vi∈V(G)deg(vi). In this paper, we apply majorization technique to extend some known results about the maximum and minimum values of the first degree-based entropy of trees, unicyclic and bicyclic graphs. © 2018, Korean Society for Computational and Applied Mathematics.