Next Article in Journal
Relationship between Population Dynamics and the Self-Energy in Driven Non-Equilibrium Systems
Next Article in Special Issue
Stimuli-Magnitude-Adaptive Sample Selection for Data-Driven Haptic Modeling
Previous Article in Journal
Entropy-Based Incomplete Cholesky Decomposition for a Scalable Spectral Clustering Algorithm: Computational Studies and Sensitivity Analysis
Previous Article in Special Issue
Estimation of Tsunami Bore Forces on a Coastal Bridge Using an Extreme Learning Machine
Open AccessArticle

A Conjecture Regarding the Extremal Values of Graph Entropy Based on Degree Powers

1
Department of Mathematics, Sungkyunkwan University, Suwon 440-746, Korea
2
Department of Biomedical Computer Science and Mechatronics, University for Health Sciences, Medical Informatics and Technology (UMIT), Eduard Wallnoefer Zentrum, A-6060 Hall in Tyrol, Austria
*
Author to whom correspondence should be addressed.
Academic Editor: Andreas Holzinger
Entropy 2016, 18(5), 183; https://doi.org/10.3390/e18050183
Received: 14 March 2016 / Revised: 10 May 2016 / Accepted: 10 May 2016 / Published: 13 May 2016
Many graph invariants have been used for the construction of entropy-based measures to characterize the structure of complex networks. The starting point has been always based on assigning a probability distribution to a network when using Shannon’s entropy. In particular, Cao et al. (2014 and 2015) defined special graph entropy measures which are based on degrees powers. In this paper, we obtain some lower and upper bounds for these measures and characterize extremal graphs. Moreover we resolve one part of a conjecture stated by Cao et al. View Full-Text
Keywords: graphs; information theory; entropy; graph entropy; degree sequences; degree powers graphs; information theory; entropy; graph entropy; degree sequences; degree powers
MDPI and ACS Style

Das, K.C.; Dehmer, M. A Conjecture Regarding the Extremal Values of Graph Entropy Based on Degree Powers. Entropy 2016, 18, 183. https://doi.org/10.3390/e18050183

AMA Style

Das KC, Dehmer M. A Conjecture Regarding the Extremal Values of Graph Entropy Based on Degree Powers. Entropy. 2016; 18(5):183. https://doi.org/10.3390/e18050183

Chicago/Turabian Style

Das, Kinkar C.; Dehmer, Matthias. 2016. "A Conjecture Regarding the Extremal Values of Graph Entropy Based on Degree Powers" Entropy 18, no. 5: 183. https://doi.org/10.3390/e18050183

Find Other Styles
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Article Access Map by Country/Region

1
Search more from Scilit
 
Search
Back to TopTop