| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 5775874 | Applied Mathematics and Computation | 2017 | 6 Pages |
Abstract
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.
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
Shujuan Cao, Matthias Dehmer, Zhe Kang,