共 50 条
Some Properties on Entropies of Graphs
被引:0
|作者:
Das, Kinkar Ch
[1
]
Shi, Yongtang
[2
,3
]
机构:
[1] Sungkyunkwan Univ, Dept Math, Suwon 440746, South Korea
[2] Nankai Univ, Ctr Combinator, Tianjin 300071, Peoples R China
[3] Nankai Univ, LPMC, Tianjin 300071, Peoples R China
基金:
中国国家自然科学基金;
关键词:
INFORMATION-THEORY;
WEIGHTED GRAPHS;
BOUNDS;
INEQUALITIES;
COMPLEXITY;
NETWORKS;
MATRIX;
D O I:
暂无
中图分类号:
O6 [化学];
学科分类号:
0703 ;
摘要:
Shannon entropies for networks have been widely introduced. Several graph invariants have been used for defining graph entropy measures. Using majorization theory, we obtain some lower and upper bounds on graph entropy measures. Moreover we prove more extremal properties for entropies of graphs.
引用
收藏
页码:259 / 272
页数:14
相关论文