Generalized Degree-Based Graph Entropies
School of Statistics and Mathematics, Zhongnan University of Economics and Law, No. 182 Nanhu Avenue, Wuhan 430073, China
Academic Editor: Angel Garrido
Symmetry 2017, 9(3), 29; https://doi.org/10.3390/sym9030029
Received: 23 November 2016 / Revised: 17 February 2017 / Accepted: 20 February 2017 / Published: 28 February 2017
(This article belongs to the Special Issue Symmetry in Complex Networks II)
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. View Full-Text
Keywords: network; information theory; entropy measure; graph entropy; generalized degree-based graph entropy; degree powers►▼ Show Figures
This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited
MDPI and ACS Style
Lu, G. Generalized Degree-Based Graph Entropies. Symmetry 2017, 9, 29.
AMA StyleShow more citation formats Show less citations formats
Lu G. Generalized Degree-Based Graph Entropies. Symmetry. 2017; 9(3):29.Chicago/Turabian Style
Lu, Guoxiang. 2017. "Generalized Degree-Based Graph Entropies." Symmetry 9, no. 3: 29.
Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.