Generalized degree-based graph entropies (Q2333475)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7129035
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Generalized degree-based graph entropies |
scientific article; zbMATH DE number 7129035 |
Statements
Generalized degree-based graph entropies (English)
0 references
13 November 2019
0 references
Summary: Inspired by the generalized entropies for graphs, a class of generalized degree-based graph entropies is proposed using the known information-theoretic measures to characterize the structure of complex networks. The new entropies depend on assigning a probability distribution about the degrees to a network. In this paper, some extremal properties of the generalized degree-based graph entropies by using the degree powers are proved. Moreover, the relationships among the entropies are studied. Finally, numerical results are presented to illustrate the features of the new entropies.
0 references
network
0 references
information theory
0 references
entropy measure
0 references
graph entropy
0 references
generalized degree-based graph entropy
0 references
degree powers
0 references
0 references
0 references
0.88587886095047
0 references
0.8798507452011108
0 references
0.8516758680343628
0 references
0.8437297344207764
0 references
0.8277241587638855
0 references
