Entropies of Composite Graphs

被引：2

作者：

Berberler, Zeynep Nihan ^{[1
]}

Berberler, Murat Ersen ^{[1
]}

机构：

[1] Dokuz Eylul Univ, Fac Sci, Dept Comp Sci, TR-35160 Izmir, Turkey

来源：

IRANIAN JOURNAL OF SCIENCE AND TECHNOLOGY TRANSACTION A-SCIENCE | 2018年 / 42卷 / A4期

关键词：

Signless Laplacian matrix; Zagreb index; Generalized graph entropy; R-corona; R-join; NETWORKS;

D O I：

10.1007/s40995-018-0574-0

中图分类号：

O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];

学科分类号：

07 ; 0710 ; 09 ;

摘要：

For measuring the complexity of a graph, an information-theoretic quantity, that is, entropy function is used. In this paper, we investigate and present explicit formulae for the complexity of classes of composite graphs based on R-graphs by evaluating the generalized graph entropies. In addition, a polynomial time algorithm is designed for computing the generalized entropy of graphs.

引用

页码：2301 / 2308

页数：8

共 28 条

[1] [Anonymous], P 4 BERK S MATH STAT
[2] Bonchev D., 1979, MATCH COMMUN MATH CO, V7, P65
[3] Bonchev D., 1983, Information theoretic indices for characterization of chemical structures
[4] Network Entropies Based on Independent Sets and Matchings
Cao, Shujuan
Dehmer, Matthias
Kang, Zhe
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2017, 307 : 265 - 270
[5] Degree-based entropies of networks revisited
Cao, Shujuan
Dehmer, Matthias
[J]. APPLIED MATHEMATICS AND COMPUTATION, 2015, 261 : 141 - 147
[6] Extremality of degree-based graph entropies
Cao, Shujuan
Dehmer, Matthias
Shi, Yongtang
[J]. INFORMATION SCIENCES, 2014, 278 : 22 - 33
[7] A Note on Distance-based Graph Entropies
Chen, Zengqiang
Dehmer, Matthias
Shi, Yongtang
[J]. ENTROPY, 2014, 16 (10) : 5416 - 5427
[8] Cvetkovic D., 1995, Spectra of Graphs: Theory and Applications, Vthird
[9] MEASURABLE SOLUTION OF A FUNCTIONAL-EQUATION ARISING IN INFORMATION-THEORY
DAROCZY, Z
JARAI, A
[J]. ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1979, 34 (1-2): : 105 - 116
[10] Das KC, 2017, MATCH-COMMUN MATH CO, V78, P259

← 1 2 3 →