TUTCRIS - Tampereen teknillinen yliopisto

TUTCRIS

On Graph Entropy Measures Based on the Number of Independent Sets and Matchings

Tutkimustuotosvertaisarvioitu

Standard

On Graph Entropy Measures Based on the Number of Independent Sets and Matchings. / Wan, Pengfei; Chen, Xinzhuang; Tu, Jianhua; Dehmer, Matthias; Zhang, Shenggui; Emmert-Streib, Frank.

julkaisussa: Information Sciences, 26.11.2019.

Tutkimustuotosvertaisarvioitu

Harvard

APA

Vancouver

Author

Wan, Pengfei ; Chen, Xinzhuang ; Tu, Jianhua ; Dehmer, Matthias ; Zhang, Shenggui ; Emmert-Streib, Frank. / On Graph Entropy Measures Based on the Number of Independent Sets and Matchings. Julkaisussa: Information Sciences. 2019.

Bibtex - Lataa

@article{1e6a67598e814fa89ffa73b1f1507227,
title = "On Graph Entropy Measures Based on the Number of Independent Sets and Matchings",
abstract = "In this paper, we consider the graph entropy measures based on the number of independent sets and matchings. The reason to study these measures relates to the fact that the independent set and matching problem is computationally demanding. However, these features can be calculated for smaller networks. In case one can establish efficient estimations, those measures may be also used for larger graphs. So, we establish some upper and lower bounds as well as some information inequalities for these information-theoretic quantities. In order to give further evidence, we also generate numerical results to study these measures such as list the extremal graphs for these entropies. Those results reveal the two entropies possess some new features.",
keywords = "Graph entropy measures, Subgraph, Independent set, Matching, Quantitative Graph Theory",
author = "Pengfei Wan and Xinzhuang Chen and Jianhua Tu and Matthias Dehmer and Shenggui Zhang and Frank Emmert-Streib",
year = "2019",
month = "11",
day = "26",
doi = "10.1016/j.ins.2019.11.020",
language = "English",
journal = "Information Sciences",
issn = "0020-0255",
publisher = "Elsevier",

}

RIS (suitable for import to EndNote) - Lataa

TY - JOUR

T1 - On Graph Entropy Measures Based on the Number of Independent Sets and Matchings

AU - Wan, Pengfei

AU - Chen, Xinzhuang

AU - Tu, Jianhua

AU - Dehmer, Matthias

AU - Zhang, Shenggui

AU - Emmert-Streib, Frank

PY - 2019/11/26

Y1 - 2019/11/26

N2 - In this paper, we consider the graph entropy measures based on the number of independent sets and matchings. The reason to study these measures relates to the fact that the independent set and matching problem is computationally demanding. However, these features can be calculated for smaller networks. In case one can establish efficient estimations, those measures may be also used for larger graphs. So, we establish some upper and lower bounds as well as some information inequalities for these information-theoretic quantities. In order to give further evidence, we also generate numerical results to study these measures such as list the extremal graphs for these entropies. Those results reveal the two entropies possess some new features.

AB - In this paper, we consider the graph entropy measures based on the number of independent sets and matchings. The reason to study these measures relates to the fact that the independent set and matching problem is computationally demanding. However, these features can be calculated for smaller networks. In case one can establish efficient estimations, those measures may be also used for larger graphs. So, we establish some upper and lower bounds as well as some information inequalities for these information-theoretic quantities. In order to give further evidence, we also generate numerical results to study these measures such as list the extremal graphs for these entropies. Those results reveal the two entropies possess some new features.

KW - Graph entropy measures

KW - Subgraph

KW - Independent set

KW - Matching

KW - Quantitative Graph Theory

U2 - 10.1016/j.ins.2019.11.020

DO - 10.1016/j.ins.2019.11.020

M3 - Article

JO - Information Sciences

JF - Information Sciences

SN - 0020-0255

ER -