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

DOI10.1007/s10114-019-8093-2zbMath1415.05087arXiv1709.09594OpenAlexW2963912272WikidataQ127901993 ScholiaQ127901993MaRDI QIDQ2311742

Dan Hu, Xiaogang Liu, Xue Liang Li, Sheng Gui Zhang

Publication date: 4 July 2019

Published in: Acta Mathematica Sinica. English Series (Search for Journal in Brave)

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

zbMATH Keywords

hypergraphgraph entropyShannon entropydegree sequence

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Hypergraphs (05C65) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Eigenvalues, singular values, and eigenvectors (15A18) Measures of information, entropy (94A17)

Related Items (1)

Some generalizations concerning inaccuracy measures

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The extremal spectral radii of \(k\)-uniform supertrees
• Maximizing spectral radii of uniform hypergraphs with few edges
• Extremality of degree-based graph entropies
• A history of graph entropy measures
• Information processing in complex networks: Graph entropy and information functionals
• Novel inequalities for generalized graph entropies -- graph energies and topological indices
• On the extremal values of general degree-based graph entropies
• Cored hypergraphs, power hypergraphs and their Laplacian H-eigenvalues
• Graphs that Split Entropies
• Entropy and the complexity of graphs: I. An index of the relative complexity of a graph
• Entropy and the complexity of graphs: II. The information content of digraphs and infinite graphs
• Entropy and the complexity of graphs: III. Graphs with prescribed information content
• Entropy and the complexity of graphs: IV. Entropy measures and graphical structure

This page was built for publication: Extremality of graph entropy based on degrees of uniform hypergraphs with few edges