Journal of Lanzhou University of Technology ›› 2021, Vol. 47 ›› Issue (3): 150-155.

• Scientific • Previous Articles     Next Articles

Extremality of graph entropy based on Laplacian degrees of k-uniform hypergraphs

LU Peng-li, XUE Yu-long   

  1. College of Computer and Communication, Lanzhou Univ. of Tech., Lanzhou 730050, China
  • Received:2019-12-19 Online:2021-06-28 Published:2021-07-19

Abstract: Motivated by the definition of graph entropy in general graphs, the graph entropy of hypergraphs based on Laplacian degree are defined. Some results on graph entropy of simple graphs are extended to k-uniform hypergraphs. By an operation of edge moving, the maximum and minimum graph entropy based on Laplacian degrees are determined in k-uniform hypertrees, unicyclic k-uniform hypergraphs, bicyclic k-uniform hypergraphs and k-uniform chemical hypertrees, respectively, and the corresponding extremal graphs are determined.

Key words: graph entropy, hypergraph, Laplacian degree

CLC Number: