Abstract
Let H be a hypergraph with n vertices. Suppose that d1,d2,…,dn are degrees of the vertices of H. The t-th graph entropy based on degrees ofH is defined as Idt(H)=−∑i=1n(dit∑j=1ndjtlogdit∑j=1ndjt)=log(∑i=1ndit)−∑i=1n(dit∑j=1ndjtlogdit), where t is a real number and the logarithm is taken to the base two. In this paper we obtain upper and lower bounds of Idt(H) for t = 1, when H is among all uniform supertrees, unicyclic uniform hypergraphs and bicyclic uniform hypergraphs, respectively.
Original language | English |
---|---|
Pages (from-to) | 1238-1250 |
Number of pages | 13 |
Journal | Acta Mathematica Sinica, English Series |
Volume | 35 |
Issue number | 7 |
DOIs | |
State | Published - 1 Jul 2019 |
Keywords
- degree sequence
- graph entropy
- hypergraph
- Shannon’s entropy