On graph entropy measures based on the number of independent sets and matchings

被引：10

作者：

Wan, Pengfei ^{[1
,2
]}

Chen, Xinzhuang ^{[2
]}

Tu, Jianhua ^{[3
]}

Dehmer, Matthias ^{[4
,5
,6
]}

Zhang, Shenggui ^{[2
]}

Emmert-Strei, Frank ^{[7
,8
]}

机构：

[1] Northwestern Polytech Univ, Sch Math & Stat, Xian 710129, Shaanxi, Peoples R China

[2] Northwestern Polytech Univ, Dept Appl Math, Xian 710072, Shaanxi, Peoples R China

[3] Beijing Univ Chem Technol, Dept Math, Beijing 100029, Peoples R China

[4] Nankai Univ, Coll Comp & Control Engn, Tianjin 300071, Peoples R China

[5] UMIT, Dept Biomed Comp Sci & Mech, Eduard Wallnoefer Zentrum 1, A-6060 Hall In Tirol, Austria

[6] Univ Appl Sci Upper Austria, Fac Management, Prod & Operat Management, Wehrgrabengasse 1-3, A-4400 Steyr, Austria

[7] Tampere Univ, Fac Informat Technol & Commun Sci, Predict Soc & Data Analyt Lab, Tampere, Finland

[8] Inst Biosci & Med Technol, Tampere, Finland

来源：

INFORMATION SCIENCES | 2020年 / 516卷 / 516期

基金：

中国国家自然科学基金;

关键词：

Graph entropy measures; Subgraph; Independent set; Matching; Quantitative graph theory; EXTREMAL PROPERTIES; INEQUALITIES; INDEX; COMPLEXITY; NETWORKS;

D O I：

10.1016/j.ins.2019.11.020

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

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. (C) 2019 Published by Elsevier Inc.

引用

页码：491 / 504

页数：14

共 50 条

[41] Matchings and independent sets of a fixed size in regular graphs
Carroll, Teena
Galvin, David
Tetali, Prasad
JOURNAL OF COMBINATORIAL THEORY SERIES A, 2009, 116 (07) : 1219 - 1227
[42] Graph Partitioning for Independent Sets
Lamm, Sebastian
Sanders, Peter
Schulz, Christian
EXPERIMENTAL ALGORITHMS, SEA 2015, 2015, 9125 : 68 - 81
[43] A history of graph entropy measures
Dehmer, Matthias
Mowshowitz, Abbe
INFORMATION SCIENCES, 2011, 181 (01) : 57 - 78
[44] NUMBER OF PARITY SETS IN A GRAPH
LITTLE, CHC
CANADIAN JOURNAL OF MATHEMATICS-JOURNAL CANADIEN DE MATHEMATIQUES, 1976, 28 (06): : 1167 - 1171
[45] Entropy measures for Atanassov intuitionistic fuzzy sets based on divergence
Montes, Ignacio
Pal, Nikhil R.
Montes, Susana
SOFT COMPUTING, 2018, 22 (15) : 5051 - 5071
[46] Entropy measures for Atanassov intuitionistic fuzzy sets based on divergence
Ignacio Montes
Nikhil R. Pal
Susana Montes
Soft Computing, 2018, 22 : 5051 - 5071
[47] Entropy, Graph Homomorphisms, and Dissociation Sets
Wang, Ziyuan
Tu, Jianhua
Lang, Rongling
ENTROPY, 2023, 25 (01)
[48] The Number of Independent Sets in Graphs
Sapozhenko, A. A.
MOSCOW UNIVERSITY MATHEMATICS BULLETIN, 2007, 62 (03) : 116 - 118
[49] On the number of independent sets in expanders
Sapozhenko, A.A.
Discrete Mathematics and Applications, 2001, 11 (02): : 155 - 161
[50] On the number of independent sets in a tree
Law, Hiu-Fai
ELECTRONIC JOURNAL OF COMBINATORICS, 2010, 17 (01):

← 1 2 3 4 5 →