The Chromatic Entropy of a p -Uniform Linear Unicyclic Hypergraph
Parallel Processing Letters · 2026-06 · 36 (01n02)
DOI: 10.1142/s0129626426500076 ↗Kurz gefasst
Fachartikel in der Zeitschrift Parallel Processing Letters, online erschienen am 28.04.2026. Verfasst von Xinge Zhang und 1 weiteren Autor:innen. Die Arbeit nennt 13 Literaturangaben. Gefördert von: National Natural Science Foundation of China, The 111 Project, Key Laboratory of Tibetan Information Processing, the Education Ministry of China.
Abstract (Originalsprache)
Graph entropy is originated from Shannon entropy, which is used to quantify the complexity and uncertainty of networks and is widely applied in fields such as information theory, communication theory and statistics. As a kind of classical graph entropy, the chromatic entropy of a graph plays a key role in describing the structures of networks. Generally, a hypergraph is the extension of a graph, which is often used in characterising complex systems. In this paper, we investigate the chromatic entropy of linear p-uniform unicyclic hypergraphs based on strong vertex coloring. We determine the hypergraphs that attain the maximum and minimum chromatic entropy within this class. Using edge-moving operations, we characterize the extremal structures and derive explicit formulas for their entropy values.
Förderung
- National Natural Science Foundation of China
- The 111 Project
- Key Laboratory of Tibetan Information Processing, the Education Ministry of China
- Tibetan Information Processing Engineering Technology and Research Center of Qinghai Province
Zitieren
APA
Zhang, X., & Deng, B. (2026). The Chromatic Entropy of a p -Uniform Linear Unicyclic Hypergraph. Parallel Processing Letters, 36(01n02). https://doi.org/10.1142/s0129626426500076
Vancouver
Zhang X, Deng B. The Chromatic Entropy of a p -Uniform Linear Unicyclic Hypergraph. Parallel Processing Letters. 2026;36(01n02). doi:10.1142/s0129626426500076
BibTeX
@article{Zhang2026,
author = {Zhang, Xinge and Deng, Bo},
title = {The Chromatic Entropy of a p -Uniform Linear Unicyclic Hypergraph},
journal = {Parallel Processing Letters},
year = {2026},
volume = {36},
number = {01n02},
doi = {10.1142/s0129626426500076}
}
EUVIMED