Graph Operations Decreasing Values of Degree-Based Graph Entropies
Jingzhi Yan, Guan Feng · match Communications in Mathematical and in Computer Chemistry · 2022
The degree-based graph entropy Id is a parametric measure derived from an information functional defined by vertex degrees of a graph, which is used to characterize the structure of complex networks. Determining minimal values of Id is challenging due to a lack of effective methods to analyze properties of minimal graphs. In this paper, we investigate minimal properties of the graph entropy in (n, m)-graphs and define two new graph operations, which can decrease the values of Id.