Graph Entropy Based on Strong Coloring of Uniform Hypergraphs
The classical graph entropy based on the vertex coloring proposed by <i>Mowshowitz</i> 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 cla...
| Main Authors: | , , , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
MDPI AG
2021-12-01
|
| Series: | Axioms |
| Subjects: | |
| Online Access: | https://www.mdpi.com/2075-1680/11/1/3 |