共 23 条
On extremal cacti with respect to the first degree-based entropy
被引:0
|作者:
Li, Weimin
[1
]
Li, Jianping
[1
]
Zhang, Jianbin
[2
]
He, Weihua
[1
]
机构:
[1] Guangdong Univ Technol, Sch Math & Stat, Guangzhou 510090, Peoples R China
[2] South China Normal Univ, Sch Math Sci, Guangzhou 510631, Peoples R China
来源:
OPEN MATHEMATICS
|
2023年
/
21卷
/
01期
关键词:
graph entropy;
cactus;
first degree-based entropy;
GRAPH ENTROPY;
D O I:
10.1515/math-2023-0108
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
Let G be a simple graph with degree sequence D(G) = (d1 d2,,.,dn) The first degree-based entropy of G is defined asI(1)(G) = 1n Sigma(n)(i=1)d(i) -1/Sigma(n)(i=1) d(i) - 1/Sigma(n)(i) = 1 di Sigma(n)(i) (=1)(d(1) 1nd(i)). 1. In this article, we give sharp upper and lower bounds for the first degree-based entropy of graphs in C(n k), and characterize the corresponding extremal graphs when each bound is attained, where C(n k), is the set of all cacti with n vertices and k cycles.
引用
收藏
页数:7
相关论文