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

zbMATH Open1488.05266arXiv2003.12384MaRDI QIDQ5017078

Pengli Lu, Yulong Xue

Publication date: 17 December 2021

Abstract: 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.

Full work available at URL: https://arxiv.org/abs/2003.12384

zbMATH Keywords

hypergraphgraph entropyLaplacian degree

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65)

Related Items (1)

Extremality of graph entropy based on degrees of uniform hypergraphs with few edges

This page was built for publication: Extremality of graph entropy based on Laplacian degrees of k-uniform hypergraphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5017078)