Extremality of degree-based graph entropies

被引：158
|
作者：
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
相关论文
共 50 条
  • [21] Connections between Generalized Graph Entropies and Graph Energy
    Dehmer, Matthias
    Li, Xueliang
    Shi, Yongtang
    COMPLEXITY, 2015, 21 (01) : 35 - 41
  • [22] Extremality of Graph Entropy Based on Degrees of Uniform Hypergraphs with Few Edges
    Dan HU
    Xue Liang LI
    Xiao Gang LIU
    Sheng Gui ZHANG
    Acta Mathematica Sinica,English Series, 2019, 35 (07) : 1238 - 1250
  • [23] Comparing degree-based energies of trees
    Gutman, Ivan
    CONTRIBUTIONS TO MATHEMATICS, 2021, 4 : 1 - 5
  • [24] First degree-based entropy of graphs
    A. Ghalavand
    M. Eliasi
    A. R. Ashrafi
    Journal of Applied Mathematics and Computing, 2019, 59 : 37 - 46
  • [25] NEW UPPER AND LOWER BOUNDS FOR SOME DEGREE-BASED GRAPH INVARIANTS
    Ghalavand, A.
    Ashrafi, A.
    Gutman, I
    KRAGUJEVAC JOURNAL OF MATHEMATICS, 2020, 44 (02): : 181 - 188
  • [26] First degree-based entropy of graphs
    Ghalavand, A.
    Eliasi, M.
    Ashrafi, A. R.
    JOURNAL OF APPLIED MATHEMATICS AND COMPUTING, 2019, 59 (1-2) : 37 - 46
  • [27] A Conjecture Regarding the Extremal Values of Graph Entropy Based on Degree Powers
    Das, Kinkar Chandra
    Dehmer, Matthias
    ENTROPY, 2016, 18 (05)
  • [28] Extremality of Graph Entropy Based on Degrees of Uniform Hypergraphs with Few Edges
    Hu, Dan
    Li, Xue Liang
    Liu, Xiao Gang
    Zhang, Sheng Gui
    ACTA MATHEMATICA SINICA-ENGLISH SERIES, 2019, 35 (07) : 1238 - 1250
  • [29] Extremality of Graph Entropy Based on Degrees of Uniform Hypergraphs with Few Edges
    Dan Hu
    Xue Liang Li
    Xiao Gang Liu
    Sheng Gui Zhang
    Acta Mathematica Sinica, English Series, 2019, 35 : 1238 - 1250
  • [30] Network Entropies Based on Independent Sets and Matchings
    Cao, Shujuan
    Dehmer, Matthias
    Kang, Zhe
    APPLIED MATHEMATICS AND COMPUTATION, 2017, 307 : 265 - 270
12345