Network Entropies Based on Independent Sets and Matchings

Shujuan Cao, Matthias Dehmer and Zhe Kang

Applied Mathematics and Computation, 2017, vol. 307, issue C, 265-270

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.

Keywords: Shannon’s entropy; Graph entropy; Independent set; Matching (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (10)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S009630031730125X
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:307:y:2017:i:c:p:265-270

DOI: 10.1016/j.amc.2017.02.021

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().