Graph Entropy Based on Strong Coloring of Uniform Hypergraphs

Axioms

Bo Deng¹  Xiaoyun Lv¹  Lusheng Fang¹  Haixing Zhao² 

[1] School of Mathematics and Statistics, Qinghai Normal University, Xining 810001, China;The State Key Laboratory of Tibetan Information Processing and Application, Xining 810008, China;

关键词: hypergraph;    graph entropy;    strong coloring;   

DOI  :  10.3390/axioms11010003

来源: DOAJ

【 摘 要 】

The classical graph entropy based on the vertex coloring proposed by Mowshowitz depends on a graph. In fact, a hypergraph, as a generalization of a graph, can express complex and high-order relations such that it is often used to model complex systems. Being different from the classical graph entropy, we extend this concept to a hypergraph. Then, we define the graph entropy based on the vertex strong coloring of a hypergraph. Moreover, some tightly upper and lower bounds of such graph entropies as well as the corresponding extremal hypergraphs are obtained.

【 授权许可】

Unknown