The reduced Sombor index and the exponential reduced Sombor index of a molecular tree (Q2157703)

The reduced Sombor index \(SO_{\mathrm{red}}(G)\) and the exponential reduced Sombor index \(e^{SO_{\mathrm{red}}}(G)\) of a graph \(G\) are defined respectively as \[ SO_{\mathrm{red}}(G)=\sum_{un\in E(G)}\sqrt{(d(u)-1)^{2} +(d(v)-1)^{2}} \] and \[ e^{SO_{\mathrm{red}}}(G)=\sum_{un\in E(G)}e^{\sqrt{(d(u)-1)^{2} +(d(v)-1)^{2}}}, \] where \(d(u)\) denotes the degree of the vertex \(u\) of \(G\). In this paper, the authors characterize the trees with maximal value of the reduced Sombor index among all molecular trees of order \(n\) with perfect matching. Also, it is shown that the maximum molecular trees of the exponential reduced Sombor index and the reduced Sombor index are the same.