  The graph entropy describes the structural information of graph. 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. Using an
edge-moving operation, 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.
