The reduced Sombor index and the exponential reduced Sombor index of a molecular tree

Graphical indices (Wiener index, Zagreb index, Randi? index, etc.) (05C09) Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Chemical graph theory (05C92) Molecular structure (graph-theoretic methods, methods of differential topology, etc.) (92E10)

Review text

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.

Recommendations

Cites work

Cited in

(14)

This page was built for publication: The reduced Sombor index and the exponential reduced Sombor index of a molecular tree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2157703)