English

On the conjecture about the exponential reduced Sombor index

Combinatorics 2022-09-05 v1

Abstract

Let G=(V(G),E(G))G=(V(G),E(G)) be a graph and d(v)d(v) be the degree of the vertex vV(G)v\in V(G). The exponential reduced Sombor index of GG, denoted by eSOred(G)e^{SO_{red}}(G), is defined as eSOred(G)=uvE(G)e(d(u)1)2+(d(v)1)2.e^{SO_{red}}(G)=\sum_{uv\in E(G)}e^{\sqrt{(d(u)-1)^2+(d(v)-1)^2}}. We obtain a characterization of extremal trees with the maximal exponential reduced Sombor index among all chemical trees of order nn. This result shows the conjecture on the exponential reduced Sombor index proposed by Liu, You, Tang and Liu [On the reduced Sombor index and its applications, MATCH Commun. Math. Comput. Chem. 86 (2021) 729--753] is negative.

Cite

@article{arxiv.2209.00787,
  title  = {On the conjecture about the exponential reduced Sombor index},
  author = {Wei Gao},
  journal= {arXiv preprint arXiv:2209.00787},
  year   = {2022}
}
R2 v1 2026-06-28T00:36:31.259Z