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 条

[21] Independent sets, matchings, and occupancy fractions
Davies, Ewan
Jenssen, Matthew
Perkins, Will
Roberts, Barnaby
JOURNAL OF THE LONDON MATHEMATICAL SOCIETY-SECOND SERIES, 2017, 96 : 47 - 66
[22] ON THE NUMBER OF PERFECT MATCHINGS IN A BIPARTITE GRAPH
de Carvalho, Marcelo H.
Lucchesi, Claudio L.
Murty, U. S. R.
SIAM JOURNAL ON DISCRETE MATHEMATICS, 2013, 27 (02) : 940 - 958
[23] The total number of matchings in triangle graph of a connected graph
Hua, Hongbo
Zhang, Libing
ARS COMBINATORIA, 2015, 118 : 243 - 251
[24] On the Number of Paths, Independent Sets, and Matchings of Low Order in (4,6)-Fullerenes
Behmaram, A.
Yousefi-Azari, H.
Ashrafi, A. R.
MATCH-COMMUNICATIONS IN MATHEMATICAL AND IN COMPUTER CHEMISTRY, 2013, 69 (01) : 25 - 32
[25] On the number of perfect matchings in the line graph of a traceable graph
Chen, Haiyan
Ye, Yinzhu
DISCRETE APPLIED MATHEMATICS, 2023, 327 : 110 - 118
[26] Counting Rules for Computing the Number of Independent Sets of a Grid Graph
De Ita Luna, Guillermo
Bello Lopez, Pedro
Marcial-Romero, Raymundo
MATHEMATICS, 2024, 12 (06)
[27] Approximate the chromatic number of a graph using maximal independent sets
Guzman-Ponce, Angelica
Raymundo Marcial-Romero, J.
De Ita, Guillermo
Hernandez, Jose A.
2016 INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS AND COMPUTERS (CONIELECOMP), 2016, : 19 - 24
[28] Extremal Threshold Graphs for Matchings and Independent Sets
Keough, L.
Radcliffe, A. J.
GRAPHS AND COMBINATORICS, 2018, 34 (06) : 1519 - 1537
[29] Independent sets and matchings in tensor product of graphs
Paulraja, P
Varadarajan, N
ARS COMBINATORIA, 2004, 72 : 263 - 276
[30] Chain hexagonal cacti: Matchings and independent sets
Doslic, Tomislav
Maloy, Frode
DISCRETE MATHEMATICS, 2010, 310 (12) : 1676 - 1690

← 1 2 3 4 5 →