Abstract
The degree-based graph entropy \(I_d\) 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 \(I_d\) 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
\(I_d\).
