Extremality of degree-based graph entropies

被引：161
作者：
Cao, Shujuan [1 ]
Dehmer, Matthias [2 ]
Shi, Yongtang [3 ,4 ]
机构：
[1] Nankai Univ, Sch Math Sci, Tianjin 300071, Peoples R China
[2] UMIT, Inst Bioinforrnat & Translat Res, Hall In Tirol, Austria
[3] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
[4] Nankai Univ, LPMC TJKLC, Tianjin 300071, Peoples R China
来源：
INFORMATION SCIENCES | 2014年 / 278卷
基金：
美国国家科学基金会;
关键词：
Information theory; Entropy; Shannon's entropy; Graph entropy; Degree sequence; Degree power; DEGREE POWERS; INFORMATION-CONTENT; INDEX; COMPLEXITY; SQUARES; BOUNDS; SUM; VARIANCE; NETWORKS; SMALLEST;
D O I：
10.1016/j.ins.2014.03.133
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
Many graph invariants have been used for the construction of entropy-based measures to characterize the structure of complex networks. Based on Shannon's entropy, we study graph entropies which are based on vertex degrees by using so-called information functionals. When considering Shannon entropy-based graph measures, there has been very little work to find their extremal values. The main contribution of this paper is to prove some extremal values for the underlying graph entropy of certain families of graphs and to find the connection between the graph entropy and the sum of degree powers. Further, conjectures to determine extremal values of graph entropies are given. (C) 2014 Elsevier Inc. All rights reserved.
引用
收藏
页码：22 / 33
页数：12
相关论文
共 79 条
[1]  
Abrego B.M., 2009, J INEQUAL PURE APPL, V10, pR64
[2]   GRAPHS WITH MAXIMAL NUMBER OF ADJACENT PAIRS OF EDGES [J].
AHLSWEDE, R ;
KATONA, GOH .
ACTA MATHEMATICA ACADEMIAE SCIENTIARUM HUNGARICAE, 1978, 32 (1-2) :97-120
[3]  
[Anonymous], 2006, Elements of Information Theory
[4]  
[Anonymous], 2001, ALGEBRAIC GRAPH THEO
[5]  
[Anonymous], 2009, Analysis of Complex Networks: From Biology to Linguistics, DOI DOI 10.1002/9783527627981.CH7
[6]   HIGHLY DISCRIMINATING DISTANCE-BASED TOPOLOGICAL INDEX [J].
BALABAN, AT .
CHEMICAL PHYSICS LETTERS, 1982, 89 (05) :399-404
[7]   On the variance of Shannon products of graphs [J].
Balogh, Jozsef ;
Smyth, Clifford .
DISCRETE APPLIED MATHEMATICS, 2008, 156 (01) :110-118
[8]   An upper bound on the sum of squares of degrees in a hypergraph [J].
Bey, C .
DISCRETE MATHEMATICS, 2003, 269 (1-3) :259-263
[9]  
Bollobas, 1978, EXTREMAL GRAPH THEOR
[10]  
Bollobás B, 2004, ELECTRON J COMB, V11
12345678