English

On the Hyperbolic Sombor Index and Its Counterpart

Combinatorics 2025-10-30 v1

Abstract

For a graph GG with edge set EE, let d(w)d(w) denote the degree of a vertex ww in GG. The hyperbolic Sombor index of GG is defined by HSO(G)=uvE(min{d(u),d(v)})1(d(u))2+(d(v))2.HSO(G)=\sum_{uv\in E}(\min\{d(u),d(v)\})^{-1}\sqrt{(d(u))^2+(d(v))^2}. If min{d(u),d(v)}\min\{d(u),d(v)\} is replaced with max{d(u),d(v)}\max\{d(u),d(v)\} in the formula of HSO(G)HSO(G), then the complementary diminished Sombor (CDSO) index is obtained. For two non-adjacent vertices vv and ww of GG, the graph obtained from GG by adding the edge vwvw is denoted by G+vwG+vw. In this paper, we attempt to correct some inaccuracies in the recent work [J. Barman, S. Das, Geometric approach to degree-based topological index: hyperbolic Sombor index, MATCH Commun. Math. Comput. Chem. 95 (2026) 63-94]. We establish a sufficient condition under which HSO(G+vw)>HSO(G)HSO(G+vw) > HSO(G) holds, and also provide a sufficient condition guaranteeing HSO(G+vw)<HSO(G)HSO(G+vw) < HSO(G). In addition, we give a lower bound on HSO(G)HSO(G) in terms of the order and size of GG. Furthermore, we obtain similar results for the CDSO index.

Cite

@article{arxiv.2510.24809,
  title  = {On the Hyperbolic Sombor Index and Its Counterpart},
  author = {Abeer M. Albalahi and Shibsankar Das and Akbar Ali and Jayjit Barman and Amjad E. Hamza},
  journal= {arXiv preprint arXiv:2510.24809},
  year   = {2025}
}

Comments

12 pages

R2 v1 2026-07-01T07:10:18.647Z