科研之友
微信
新浪微博
Facebook
分享链接
摘要
Entropy-based measures have been used to characterize the structure of complex networks. Various graph entropies based on different graph parameters have been proposed and studied. So, it has been intricate to decide which measure is the right one for solving a particular problem. In this paper, we introduce graph entropy measures based on independent sets and matchings of graphs. The values of entropies of some special graphs are calculated and we draw several conclusions regrading the usability of the measures. Based on our findings, we conclude that it should be demanding studying extremal values of the novel entropies.
