Preprint
Article

This version is not peer-reviewed.

Bounds for the Hyperbolic Sombor Index in Terms of the Variable Euler–Sombor Index and Relations to Other Degree-Based Invariants

Submitted:

12 July 2026

Posted:

14 July 2026

You are already at the latest version

Abstract
The recently introduced Hyperbolic Sombor index HSO(G) is defined as HSO(G)=∑uv∈E(G)√du2+dv2/min{du,dv}. In this paper, we investigate the mathematical properties of this novel vertex-degree-based topological index for general graphs. We first establish tight upper and lower bounds on HSO(G) in terms of the variable Euler–Sombor index EU(λ,G) for all λ ≥ −2. Furthermore, we derive new bounds connecting HSO(G) with three other well-known degree-based invariants: the second Zagreb index M2(G), the Elliptic Sombor index ESO(G), and the Forgotten Sombor index FSO(G).
Keywords: 
;  ;  

1. Introduction

Topological indices play a significant role in chemistry, pharmacology, and particularly in QSPR/QSAR research, where numerous such indices have been developed to predict the physicochemical properties of molecular structures. Over the past few decades, a series of vertex-degree-based topological indices have been introduced, and they have proven highly effective in predicting molecular properties. Let G = ( V ( G ) , E ( G ) ) be a simple graph with n vertices and m edges. For a vertex u V ( G ) , denote its degree by d G ( u ) . Let δ ( G ) and Δ ( G ) be the minimum and maximum degrees of G, respectively. When the graph is clear from the context, we simplify the notation to d u , δ and Δ . Degree-based topological indices of a graph G, denoted by T I ( G ) , are generally defined as
T I ( G ) = u v E ( G ) ψ ( d u , d v ) ,
where ψ ( x , y ) 0 is a real-valued function satisfying the symmetric property ψ ( x , y ) = ψ ( y , x ) . A large number of vertex-degree-based topological indices have been introduced and studied extensively [16,28,48].
In this paper, we mainly focus on a very recently proposed index, named the Hyperbolic Sombor index  H S O ( G ) , for a graph G. It was introduced by Barman and Das [7] and defined as
H S O ( G ) = u v E ( G ) d u 2 + d v 2 min { d u , d v } .
Among the many topological molecular descriptors that have been proposed, we only recall those that will be needed in the remainder of this text.
The first Zagreb index  M 1 ( G ) and second Zagreb index  M 2 ( G ) are among the oldest degree-based topological descriptors [15], defined respectively as
M 1 ( G ) = u v E ( G ) ( d u + d v ) = v V ( G ) d v 2
and
M 2 ( G ) = u v E ( G ) d u · d v .
In the study of vertex-degree-based topological indices, Gutman [18] proposed a novel framework motivated by the geometric interpretation of the Euclidean distance from the origin to the point ( d u , d v ) . Based on this concept, the Sombor index  S O ( G ) was defined and quickly became one of the most widely studied topological indices in recent years. Its chemical applications can be found in [31,39], while mathematical properties and extremal graph results are surveyed in [17,32]. Alongside the Sombor index, the Elliptic Sombor index  E S O ( G )  [21], the Euler–Sombor index  E U ( G )  [20,47], and a variable version of the Euler-Sombor index E U ( λ , G )  [22] for a real number λ were proposed. These indices are defined as follows:
S O ( G ) = u v E ( G ) d u 2 + d v 2 ;
E S O ( G ) = u v E ( G ) d u + d v d u 2 + d v 2 ;
E U ( G ) = u v E ( G ) d u 2 + d v 2 + d u d v ;
E U ( λ , G ) = u v E d u 2 + d v 2 + λ d u d v .
Note that S O ( G ) = E U ( 0 , G ) , E U ( G ) = E U ( 1 , G ) and M 1 ( G ) = E U ( 2 , G ) . When λ = 2 , it gives the oldest graph-theoretical irregularity measure, the Albertson index [4], denoted A l b ( G ) , which is defined as
A l b ( G ) = u v E ( G ) | d u d v | .
The Forgotten Sombor index  F S O  [29], which arises from the Euclidean distance from the origin to the squared degree pair ( d u 2 , d v 2 ) , is also considered in this paper:
F S O ( G ) = u v E ( G ) d u 4 + d v 4 .
The chemical relevance of these vertex-degree-based topological indices, their comparative inequalities with other indices, and the characterization of extremal graphs for these indices have been widely investigated in recent years [1,2,3,8,9,10,11,12,13,14,19,23,25,26,27,30,33,34,35,37,38,40,41,42,43,44,45,46,49]. For a comprehensive understanding of Sombor-type degree-based topological indices, please refer to the survey [24] by Gutman.
In this paper, we first establish upper and lower bounds for the Hyperbolic Sombor index H S O ( G ) of a graph G in terms of the variable Euler-Sombor index E U ( λ , G ) . Furthermore, we provide upper and lower bounds for H S O ( G ) in relation to several other degree-based topological invariants, namely the second Zagreb index M 2 ( G ) , the Elliptic Sombor index E S O ( G ) , and the Forgotten Sombor index F S O ( G ) .

2. Bounds for HSO ( G ) via the Variable Euler–Sombor Index EU ( λ , G )

In the study of the variable Euler-Sombor index, Gutman et al. [22] pointed out that, in the general case, E U ( λ ) is well-defined (i.e., real-valued) only for λ 2 .
Moreover‌, a second-degree polynomial approximation was obtained:
E U ( λ ) λ 2 8 ( M 1 + A l b 2 S O ) + λ 4 ( M 1 A l b ) + S O .
The approximation is best applicable for λ [ 2 , 2 ] .
In this section, we establish upper and lower bounds for the Hyperbolic Sombor index in terms of the variable Euler-Sombor index when λ 2 .

2.1. Preliminaries

We first introduce Ferrari’s method [5] for solving the quartic equation a x 4 + b x 3 + c x 2 + d x + e = 0 . Define
P = c 2 + 12 a e 3 b d 9 , Q = 27 a d 2 + 2 c 3 + 27 b 2 e 72 a c e 9 b c d 54 ,
D = Q 2 P 3 ,
u = Q + D 3 or u = Q D 3 ( choose the one with larger modulus ) ,
v = P u ( set v = 0 if u = 0 ) , ω = 1 2 + 3 2 i ,
m = b 2 8 3 a c + 4 a ω k 1 u + ω 4 k v ,
S = 2 b 2 16 3 a c 4 a ω k 1 u + ω 4 k v ,
T = 8 a b c 16 a 2 d 2 b 3 m .
In the above three formulas for m, S and T, k can take values 1 , 2 , 3 . We should choose the triple ( m , S , T ) such that | m | is maximized. If all three | m | are zero, then instead take ( m , S , T ) = 0 , b 2 8 3 a c , 0 . Then the roots of the quartic equations are given as follows by Ferrari’s method.
Lemma 1. 
[5] The four roots of the quartic equation a x 4 + b x 3 + c x 2 + d x + e = 0 are given by
x n = b + ( 1 ) n / 2 m + ( 1 ) n + 1 S + ( 1 ) n / 2 T 4 a ,
where n = 1 , 2 , 3 , 4 , and ( m , S , T ) is the triple chosen above.
Next we will give the roots of the quartic equation 2 u 4 + λ u 3 + 4 u 2 + 3 λ u + 2 = 0 under certain conditions. According to Ferrari’s method, we can define the following expressions:
P = 64 9 λ 2 , Q = 8 λ 2 512 27 , D = λ λ 4 + 128 3 λ 2 4096 27 ,
u = Q + D 3 , v = P u , w = u + v ,
m = λ 2 64 3 + 8 w , S = 2 λ 2 128 3 8 w , T = 2 λ ( λ 2 + 64 ) m .
Lemma 2. 
Let the parameter λ ( 2 , λ 0 ) , where λ 0 = 8 3 2 3 3 1.8167 . Then the quartic equation
2 u 4 + λ u 3 + 4 u 2 + 3 λ u + 2 = 0
has exactly two real roots u a and u b in ( 0 , 1 ) , which can be expressed as
u a = λ + m S + T 8 , u b = λ + m + S + T 8 .
where u a < u b .
Proof. 
The equation is of the form a u 4 + b u 3 + c u 2 + d u + e = 0 with
a = 2 , b = λ , c = 4 , d = 3 λ , e = 2 .
Introduce the intermediate quantities
P = c 2 + 12 a e 3 b d 9 = 64 9 λ 2 ,
Q = 27 a d 2 + 2 c 3 + 27 b 2 e 72 a c e 9 b c d 54 = 8 λ 2 512 27 .
Then
Q 2 = 64 λ 4 8192 27 λ 2 + 262144 729 ,
P 3 = 262144 729 4096 27 λ 2 + 64 3 λ 4 λ 6 .
Subtracting, we have
Q 2 P 3 = λ 6 + 128 3 λ 4 4096 27 λ 2 = λ 2 λ 4 + 128 3 λ 2 4096 27 .
For λ ( 2 , λ 0 ) , set t = λ 2 . The expression in parentheses becomes the quadratic
f ( t ) = t 2 + 128 3 t 4096 27 ,
which has two real roots, the positive one is
t 0 = 64 9 ( 2 3 3 ) = λ 0 2 .
Since λ 2 > λ 0 2 = t 0 , we have f ( λ 2 ) > 0 , hence Q 2 P 3 > 0 . Moreover, λ < 0 , so
D = Q 2 P 3 = λ λ 4 + 128 3 λ 2 4096 27 > 0 .
Because D = Q 2 P 3 < Q , we get Q D > 0 and
Q + D > Q D > 0
Hence we set
u = Q + D 3 , v = P u = 64 9 λ 2 u .
Introduce the primitive cube root of unity ω = 1 2 + 3 2 i . To obtain real coefficients in the subsequent expressions we choose k = 1 , then
ω k 1 u + ω 4 k v = u + v .
Denote ω 1 = u + v . Consequently,
m = b 2 8 3 a c + 4 a ( ω k 1 u + ω 4 k v ) = λ 2 64 3 + 8 ω 1 ,
S = 2 b 2 16 3 a c 4 a ( ω k 1 u + ω 4 k v ) = 2 λ 2 128 3 8 ω 1 ,
T = 8 a b c 16 a 2 d 2 b 3 m = 2 λ ( λ 2 + 64 ) m .
From Q 2 P 3 > 0 we have Q > P 3 / 2 . Also P , Q , D > 0 , so
Q + D > Q > P 3 / 2 ,
which implies
u = Q + D 3 > P .
By the AM–GM inequality,
ω 1 = u + v = u + P u > 2 P .
Set t = λ 2 ( λ 0 2 , 4 ) . Then P = 64 9 t and
t 64 3 + 8 ω 1 > t 64 3 + 16 64 9 t = f ( t ) .
Since
f ( t ) = 1 8 64 9 t < 0 ,
for t ( λ 0 2 , 4 ) we have f ( t ) > f ( 4 ) = 4 64 3 + 16 28 9 > 0 . So m 2 > 0 , and consequently m > 0 . Then T > 0 .
Claim 1. The equation 2 u 4 + 2 u 3 + 4 u 2 + 3 u + 2 = 0 has exactly two real roots u a and u b in ( 0 , 1 ) , with u a < u b .
Proof. In fact, let p ( u ) = 2 u 4 + λ u 3 + 4 u 2 + 3 λ u + 2 , u ( 0 , 1 ] . Then
p ( 0 ) = 2 > 0 , p ( 1 ) = 8 + 4 λ > 0 ,
p ( u ) = 8 u 3 + 3 λ u 2 + 8 u + 3 λ ,
p ( u ) = 24 u 2 + 6 λ u + 8 .
The discriminant of this quadratic is 36 λ 2 768 < 0 . Hence p ( u ) is strictly increasing on ( 0 , 1 ] . Since p ( 0 ) = 3 λ < 0 and p ( 1 ) = 16 + 6 λ > 0 , there exists u 0 ( 0 , 1 ) such that p ( u 0 ) = 0 . Therefore p ( u ) first decreases and then increases on ( 0 , 1 ] . Setting p ( u 0 ) = 0 gives λ = 8 3 u 0 . Substituting into p ( u 0 ) yields the minimum value p min :
p min = 2 3 u 0 4 4 u 0 2 + 2 .
Let t = u 0 2 ( 0 , 1 ) . Then
p min = 2 3 t 2 4 t + 2 .
Consider the equation
2 3 t 2 4 t + 2 = 0 .
The positive root is t = 2 3 3 . Hence
u 0 = 2 3 3 , λ 0 = 8 3 2 3 3 1.8167 .
Therefore,we have
  • If λ [ λ 0 , 0 ) , then p min 0 , so p ( u ) 0 for all u ( 0 , 1 ] .
  • If λ ( 2 , λ 0 ) , then p min < 0 .
Together with p ( 0 ) > 0 and p ( 1 ) > 0 , when λ ( 2 , λ 0 ) the equation p ( u ) = 0 has exactly two real roots in ( 0 , 1 ) , denoted 0 < u a < u b < 1 . □
Claim 2. The equation 2 u 4 + λ u 3 + 4 u 2 + 3 λ u + 2 = 0 has no real roots for u 0 and u 1 .
Proof. In fact, consider p ( u ) , we have
p ( u ) = 8 u 3 + 3 λ u 2 + 8 u + 3 λ = ( u 2 + 1 ) ( 8 u + 3 λ ) .
If u 0 , set u = t ( t 0 ) , then p ( t ) = 2 t 4 λ t 3 + 4 t 2 3 λ t + 2 . Because λ < 0 , all coefficients are positive, so p ( t ) > 0 identically. Thus no real root for u 0 . If u 1 , then λ ( 2 , λ 0 ) implies 3 λ > 6 , hence 8 u + 3 λ > 2 . Thus p ( u ) > 0 and p ( u ) p ( 1 ) > 0 , so no real root for u 1 . □
Therefore the quartic possesses exactly two real roots (and two complex roots). By Ferrari’s method, the four roots are
x 1 , 2 = λ m ± S T 8 , x 3 , 4 = λ + m ± S + T 8 .
Since T > 0 , clearly S + T > S T . Because there are exactly two real roots, we must have
S T < 0 < S + T .
Hence we take x 3 , 4 as the real ones, yielding
u a = λ + m S + T 8 , u b = λ + m + S + T 8 ,
with u a < u b .

2.2. Bounds for H S O ( G ) via E U ( λ , G )

Lemma 3. 
Let δ x y Δ , λ 0 = 8 3 2 3 3 and λ > 2 . Define
f ( x , y ) = x 2 + y 2 x x 2 + y 2 + λ x y .
Then for λ 0 ,
2 Δ 2 + λ f ( x , y ) δ 2 + Δ 2 δ δ 2 + Δ 2 + λ δ Δ .
For λ [ λ 0 , 0 ) ,
2 Δ 2 + λ f ( x , y ) 2 δ 2 + λ .
For λ ( 2 , λ 0 ) , when x Δ · u a ,
1 Δ · min 1 + u a 2 u a 1 + u a 2 + λ u a , 2 2 + λ f ( x , y ) 2 δ 2 + λ ;
When Δ · u a < x < Δ · u b ,
1 Δ · min δ 2 + Δ 2 δ δ 2 + Δ 2 + λ δ Δ , 2 2 + λ f ( x , y ) 2 δ 2 + λ ;
When x Δ · u b ,
2 Δ 2 + λ f ( x , y ) 2 δ 2 + λ ,
where u a and u b are the two real roots in ( 0 , 1 ) from Lemma 2 of the equation 2 u 4 + λ u 3 + 4 u 2 + 3 λ u + 2 = 0 for λ ( 2 , λ 0 ) .
Proof. 
Set t = y x 1 . Then
f ( x , y ) = 1 x · 1 + t 2 1 + λ t + t 2 .
Denote h ( t ) = 1 + t 2 1 + λ t + t 2 . Then h ( t ) = λ ( t 2 1 ) ( 1 + t 2 + λ t ) 2 .
Therefore, if t 1 , we have the following three cases:
  • If λ > 0 , then h ( t ) > 0 , so h ( t ) is strictly increasing.
  • If λ = 0 , then h ( t ) 1 .
  • If λ < 0 , then h ( t ) < 0 , so h ( t ) is strictly decreasing.
Hence, for fixed x, the function f ( x , y ) = 1 x h y x has the same monotonicity in y:
  • If λ 0 , then f ( x , y ) is increasing in y.
  • If λ 0 , then f ( x , y ) is decreasing in y.
Case 1:  λ 0 .
For fixed x, the function f ( x , y ) is increasing in y. Hence
2 x 2 + λ = f ( x , x ) f ( x , y ) f ( x , Δ ) = x 2 + Δ 2 x x 2 + Δ 2 + λ x Δ .
Note that the function h ( x ) = 2 x 2 + λ decreases with x. Therefore on x [ δ , Δ ] ,
max h ( x ) = h ( δ ) = 2 δ 2 + λ , min h ( x ) = h ( Δ ) = 2 Δ 2 + λ .
Now consider φ ( x ) = f ( x , Δ ) . Taking logariTheorems,
ln φ ( x ) = 1 2 ln ( x 2 + Δ 2 ) ln x 1 2 ln ( x 2 + Δ 2 + λ x Δ ) .
Differentiating,
φ ( x ) φ ( x ) = Δ 2 x ( x 2 + Δ 2 ) 2 x + λ Δ 2 ( x 2 + Δ 2 + λ x Δ ) < 0 ,
so φ is also decreasing. Hence for x [ δ , Δ ] ,
max φ ( x ) = φ ( δ ) = δ 2 + Δ 2 δ δ 2 + Δ 2 + λ δ Δ , min φ ( x ) = φ ( Δ ) = 2 Δ 2 + λ .
Since for λ 0 we have
δ 2 + Δ 2 δ δ 2 + Δ 2 + λ δ Δ 2 δ 2 + λ ,
it follows that
max h ( x ) , φ ( x ) = φ ( δ ) , min h ( x ) , φ ( x ) = h ( Δ ) .
Consequently, for all δ x y Δ ,
max f ( x , y ) = δ 2 + Δ 2 δ δ 2 + Δ 2 + λ δ Δ , min f ( x , y ) = 2 Δ 2 + λ .
Case 2:  λ < 0 .
For fixed x, the function f ( x , y ) is decreasing in y. Hence
x 2 + Δ 2 x x 2 + Δ 2 + λ x Δ = f ( x , Δ ) f ( x , y ) f ( x , x ) = 2 x 2 + λ .
Clearly f ( x , x ) decreases with x. Thus
f ( x , y ) f ( x , x ) f ( δ , δ ) = 2 δ 2 + λ .
For the lower bound, consider f ( x , Δ ) . Set u = x Δ ( 0 , 1 ] . Then
f ( x , Δ ) = 1 Δ · 1 + u 2 u 1 + u 2 + λ u = 1 Δ g ( u ) .
Define h ( u ) = g 2 ( u ) = 1 + u 2 u 2 ( 1 + u 2 + λ u ) . Differentiating,
h ( u ) = 2 u 4 + λ u 3 + 4 u 2 + 3 λ u + 2 u 3 ( 1 + u 2 + λ u ) 2 ,
where the denominator is always positive.
Let p ( u ) = 2 u 4 + λ u 3 + 4 u 2 + 3 λ u + 2 , u ( 0 , 1 ] . By Lemma 2, we obtain that p ( u ) has exactly two real roots u a and u b in ( 0 , 1 ) , denoted 0 < u a < u b < 1 . Moreover,
p ( u ) > 0 on ( 0 , u a ) ( u b , 1 ] , p ( u ) < 0 on ( u a , u b ) .
Hence the monotonicity of g ( u ) is as follows.
  • If λ [ λ 0 , 0 ) , then p ( u ) 0 implies g ( u ) 0 . Thus g ( u ) is decreasing on ( 0 , 1 ] . Consequently, the minimum value is 1 Δ g ( 1 ) .
  • If λ ( 2 , λ 0 ) , then g ( u ) is decreasing on ( 0 , u a ) ( u b , 1 ] and increasing on ( u a , u b ) . Since u [ δ Δ , 1 ] , we have:
    (1)
    If δ Δ u a , the minimum is 1 Δ min { g ( u a ) , g ( 1 ) } ;
    (2)
    If u a < δ Δ < u b , the minimum is 1 Δ min { g ( δ Δ ) , g ( 1 ) } ;
    (3)
    If δ Δ u b , the minimum is 1 Δ g ( 1 ) .
Here
g ( 1 ) = 2 2 + λ , g δ Δ = δ 2 + Δ 2 δ δ 2 + Δ 2 + λ δ Δ .
For any edge u v of G with d u d v . We have
d u 2 + d v 2 / d u d u 2 + d v 2 + λ d u d v = f ( d u , d v ) .
Then by Lemma 3 and summing over all edges of G, we obtain the bounds for H S O ( G ) via E U ( λ , G ) as follows, where u a and u b are given by Lemma 2.
Theorem 1. 
Let G be a connected graph with m edges, maximum degree Δ and minimum degree δ. Let the parameters λ > 2 and λ 0 = 8 3 2 3 3 . If λ 0 , then
2 Δ 2 + λ E U ( λ , G ) HSO ( G ) δ 2 + Δ 2 δ δ 2 + Δ 2 + λ δ Δ E U ( λ , G ) .
If λ [ λ 0 , 0 ) , then
2 Δ 2 + λ E U ( λ , G ) HSO ( G ) 2 δ 2 + λ E U ( λ , G ) .
If λ ( 2 , λ 0 ) , then when δ Δ u a ,
1 Δ min 1 + u a 2 u a 1 + u a 2 + λ u a , 2 2 + λ H S O ( G ) E U ( λ , G ) 2 δ 2 + λ ;
When u a < δ Δ < u b ,
1 Δ min δ 2 + Δ 2 δ δ 2 + Δ 2 + λ δ Δ , 2 2 + λ H S O ( G ) E U ( λ , G ) 2 δ 2 + λ ;
When δ Δ u b ,
2 Δ 2 + λ E U ( λ , G ) HSO ( G ) 2 δ 2 + λ E U ( λ , G ) .
Both bounds are attained when G is regular.
Taking λ = 0 , 1 and 2 , we respectively obtain the following three corollaries.
Corollary 1. 
[7] Let G be a connected graph with m edges, maximum degree Δ and minimum degree δ. Then
1 Δ SO ( G ) HSO ( G ) 1 δ SO ( G ) .
Both bounds are attained when G is regular.
Corollary 2. 
Let G be a connected graph with m edges, maximum degree Δ and minimum degree δ. Then
6 3 Δ E U ( G ) HSO ( G ) δ 2 + Δ 2 δ δ 2 + Δ 2 + δ Δ E U ( G ) .
Both bounds are attained when G is regular.
Corollary 3. 
[36] Let G be a connected graph with m edges, maximum degree Δ and minimum degree δ. Then
1 2 Δ M 1 ( G ) HSO ( G ) δ 2 + Δ 2 δ ( δ + Δ ) M 1 ( G ) .
Both bounds are attained when G is regular.
If λ = 2 , then E u ( λ , G ) = A l b ( G ) . We also obtain the bounds for H S O ( G ) in terms of A l b ( G ) .
Theorem 2. 
Let G be a connected graph with m edges, maximum degree Δ, and minimum degree δ. Then
2 m + 1 2 Δ Alb ( G ) HSO ( G ) 2 m + 1 δ Alb ( G ) .
Both bounds are attained when G is regular.
Proof. 
Set d u d v and let t = d v d u 1 . Since
[ 2 + ( t 1 ) ] 2 ( 1 + t 2 ) 2 = 2 ( 2 1 ) ( t 1 ) 0 ,
we obtain
1 + t 2 2 + ( t 1 ) .
Consequently,
d u 2 + d v 2 d u = 1 + d v d u 2 2 + d v d u 1 2 + d v d u δ .
Summing over all edges yields the upper bound
HSO ( G ) 2 m + 1 δ Alb ( G ) .
Since
( 1 + t 2 ) 2 2 + 1 2 ( t 1 ) 2 = 1 2 ( t 1 ) 2 0 ,
we obtain
1 + t 2 2 + 1 2 ( t 1 ) .
Hence
d u 2 + d v 2 d u = 1 + d v d u 2 2 + 1 2 d v d u 1 2 + d v d u 2 Δ .
Summing over all edges gives the lower bound
HSO ( G ) 2 m + 1 2 Δ Alb ( G ) .

3. Bounds for HSO ( G ) in Terms of M 2 ( G ) , ESO ( G ) and FSO ( G )

In this section, we establish upper and lower bounds for the Hyperbolic Sombor index in terms of several other degree-based topological invariants.
Lemma 4. 
For δ x y Δ , let R ( x , y ) = x 2 + y 2 x 2 y . Then
2 Δ 2 R ( x , y ) 2 δ 2 .
Proof. 
Fix x and regard R ( x , y ) = x 2 + y 2 x 2 y as a function of y:
f ( y ) = x 2 + y 2 x 2 y = 1 x 2 · x 2 + y 2 y = 1 x 2 · 1 + x y 2 .
Clearly, f ( y ) is monotonically decreasing in y for δ x y Δ . Hence R ( x , y ) is monotonically decreasing in y. Therefore, for a fixed x, R ( x , y ) attains its maximum at y = x and its minimum at y = Δ ; that is,
R ( x , x ) = 2 x 2 , R ( x , Δ ) = x 2 + Δ 2 x 2 Δ .
Now consider R ( x , x ) as a function of x. It is clearly monotonically decreasing in x. So it attains its maximum 2 δ 2 at x = δ and its minimum 2 Δ 2 at x = Δ .
Next, consider R ( x , Δ ) . Let h ( x ) = R ( x , Δ ) = x 2 + Δ 2 x 2 Δ . Then
ln h ( x ) = 1 2 ln ( x 2 + Δ 2 ) 2 ln x ln Δ .
Differentiating, we obtain
h ( x ) h ( x ) = x x 2 + Δ 2 2 x = x 2 2 Δ 2 x ( x 2 + Δ 2 ) < 0 .
Thus h ( x ) is monotonically decreasing, and so is R ( x , Δ ) in x. Consequently, R ( x , Δ ) attains its maximum δ 2 + Δ 2 δ 2 Δ at x = δ and its minimum 2 Δ 2 at x = Δ .
Combining the above, the global maximum of R ( x , y ) over δ x y Δ is 2 δ 2 , and the global minimum is 2 Δ 2 . □
Theorem 3. 
Let G be a connected graph with m edges, maximum degree Δ and minimum degree δ. Then
2 Δ 2 M 2 ( G ) H S O ( G ) 2 δ 2 M 2 ( G ) .
Both bounds are attained when G is regular.
Proof. 
For any edge u v E ( G ) , Lemma 4 gives
2 Δ 2 d u 2 + d v 2 d u 2 d v 2 δ 2 .
Multiplying both sides by the positive factor d u d v yields
2 Δ 2 d u d v d u 2 + d v 2 d u 2 δ 2 d u d v .
Summing over all edges and noting that d u = min { d u , d v } , we obtain
2 Δ 2 M 2 ( G ) H S O ( G ) 2 δ 2 M 2 ( G ) ,
where equality holds if and only if G is regular. □
Lemma 5. 
For δ x y Δ , let f ( x , y ) = 1 x ( x + y ) . Then
1 2 Δ 2 f ( x , y ) 1 2 δ 2 .
Proof. 
Since x y Δ and x δ , we have
x + y 2 x 2 δ and x + y 2 y 2 Δ .
Hence
f ( x , y ) = 1 x ( x + y ) 1 x · 2 x = 1 2 x 2 1 2 δ 2 ,
and
f ( x , y ) = 1 x ( x + y ) 1 x · 2 Δ 1 2 Δ 2 ,
Both bounds are sharp: the upper bound is attained when x = y = δ , and the lower bound when x = y = Δ . □
Theorem 4. 
Let G be a connected graph with m edges, maximum degree Δ, and minimum degree δ. Then
1 2 Δ 2 E S O ( G ) H S O ( G ) 1 2 δ 2 E S O ( G ) .
Both bounds are attained when G is regular.
Proof. 
For any edge u v E ( G ) , assume without loss of generality that d u d v . By Lemma 5, we have
1 2 Δ 2 1 d u ( d u + d v ) 1 2 δ 2 .
Multiplying both sides by the positive factor ( d u + d v ) d u 2 + d v 2 , we have
1 2 Δ 2 ( d u + d v ) d u 2 + d v 2 d u 2 + d v 2 d u 1 2 δ 2 ( d u + d v ) d u 2 + d v 2 .
Summing this inequality over all edges of G and noting that d u = min { d u , d v } , we obtain
1 2 Δ 2 E S O ( G ) H S O ( G ) 1 2 δ 2 E S O ( G ) ,
All the inequalities above hold with equality when G is regular. □
Lemma 6. 
Let δ x y Δ and define f ( x , y ) = x 2 + y 2 x x 4 + y 4 . Then
1 Δ 2 f ( x , y ) 1 δ 2 .
Proof. 
Let t = y / x 1 . Then
f ( x , y ) = 1 x 2 1 + t 2 1 + t 4 .
Set g ( t ) = 1 + t 2 1 + t 4 . For t 1 ,
g ( t ) = 2 t 4 t 3 2 t 5 ( 1 + t 4 ) 2 < 0 ,
so g ( t ) (and hence g ( t ) ) is strictly decreasing. Therefore, for fixed x, f ( x , y ) decreases as y increases. Consequently,
max y x f ( x , y ) = f ( x , x ) = 1 x 2 , min y x f ( x , y ) = f ( x , Δ ) = x 2 + Δ 2 x x 4 + Δ 4 .
Now consider h ( x ) = f ( x , x ) = 1 / x 2 , which clearly decreases with x. Hence on x [ δ , Δ ] ,
max h ( x ) = h ( δ ) = 1 δ 2 , min h ( x ) = h ( Δ ) = 1 Δ 2 .
For φ ( x ) = f ( x , Δ ) , take logariTheorems:
ln φ ( x ) = 1 2 ln ( x 2 + Δ 2 ) ln x 1 2 ln ( x 4 + Δ 4 ) .
Differentiating,
φ ( x ) φ ( x ) = Δ 2 x ( x 2 + Δ 2 ) 2 x 3 x 4 + Δ 4 < 0 ,
so φ is decreasing as well. Thus for x [ δ , Δ ] ,
max φ ( x ) = φ ( δ ) = δ 2 + Δ 2 δ δ 4 + Δ 4 , min φ ( x ) = φ ( Δ ) = 1 Δ 2 .
Since max 1 δ 2 , δ 2 + Δ 2 δ δ 4 + Δ 4 = 1 δ 2 , we have, for δ x y Δ ,
max f ( x , y ) = 1 δ 2 , min f ( x , y ) = 1 Δ 2 .
Theorem 5. 
Let G be a connected graph with m edges, maximum degree Δ and minimum degree δ. Then
1 Δ 2 F S O ( G ) H S O ( G ) 1 δ 2 F S O ( G ) .
Both bounds are attained when G is regular.
Proof. 
For any edge u v with d u d v . By Lemma 6, we have
1 Δ 2 d u 2 + d v 2 d u d u 4 + d v 4 1 δ 2 .
Multiplying by the positive factor d u 4 + d v 4 gives
1 Δ 2 d u 4 + d v 4 d u 2 + d v 2 d u 1 δ 2 d u 4 + d v 4 .
Summing over all edges, and noting that d u = min { d u , d v } , we obtain
1 Δ 2 F S O ( G ) H S O ( G ) 1 δ 2 F S O ( G ) .

4. Discussion

The main contributions of this study are to provide several sharp upper and lower bounds for the Hyperbolic Sombor index HSO ( G ) . In Theorem 1, we establish a relationship between HSO ( G ) and the variable Euler-Sombor index E U ( λ , G ) , and give precise bounds for different ranges of the parameter λ . In particular, by taking λ = 0 , 1 , 2 , we obtain bounds relating HSO ( G ) to SO ( G ) , E U ( G ) , and M 1 ( G ) , respectively. Theorem 2 provides upper and lower bounds for HSO ( G ) in terms of the Albertson index Alb ( G ) .
Moreover, Theorems 3–5 establish concise inequalities between HSO ( G ) and M 2 ( G ) , ESO ( G ) , as well as FSO ( G ) . These results enrich the mathematical theory of the Hyperbolic Sombor index and also provide tools for future research.
This paper establishes, for the first time, a connection between H S O ( G ) and the variable Euler-Sombor index E U ( λ , G ) . The index E U ( λ , G ) is a unified framework proposed by Gutman et al. [22], which yields, for different values of λ , the known indices S O ( G ) , E U ( G ) , M 1 ( G ) , and A l b ( G ) . Through this unified framework, our paper not only systematically covers several existing index cases, but also reveals deeper structural relationships between H S O ( G ) and these indices. The novelty of this methodological approach lies in the fact that, by means of Ferrari’s method for solving quartic equations, we precisely characterize the variation of the relevant functions at the critical parameter λ 0 = 8 3 2 3 3 1.8167 , thereby obtaining piecewise sharp bounds.
Recently, Rada et al. [36] introduced the general form of the Hyperbolic Sombor index
H S O a ( G ) = u v E ( G ) d u 2 + d v 2 min { d u , d v } a ,
where a is a real number. Whether the methodology of the present paper can be extended to this general form is a direction worth exploring.
Although preliminary studies have shown that H S O ( G ) possesses good predictive capability[6], integrating these predictive capabilities with the formulas obtained in this paper to establish bound-based prediction models remains an open problem.
Moreover, the family of Sombor-type indices is growing increasingly large, including the Sombor index, the Elliptic Sombor index, the Euler-Sombor index, the Forgotten Sombor index, and the Hyperbolic Sombor index studied in this paper. A systematic comparison among these indices and the establishment of a unified theoretical framework would contribute to a deeper understanding of the nature of degree-based topological indices.

Author Contributions

Conceptualization, W.Z. and S.L.; methodology, W.Z. and S.L.; validation, R.S.; formal analysis, W.Z. and S.L.; investigation, W.Z., S.L., and R.S.; writing—original draft preparation, W.Z.; writing—review and editing, S.L. and R.S.; supervision, S.L.; funding acquisition, S.L. and R.S. All authors have read and agreed to the published version of the manuscript.

Data Availability Statement

No new data were created or analyzed in this study. Data sharing is not applicable to this article.

Acknowledgments

This work is supported by the National Natural Science Foundation of China (grant number 12201471) and the Science and Technology Plan Program of Gansu Province of China (No. 24JRRM005).

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Aashtab, A.; Akbari, S.; Madadinia, S.; Noei, M.; Salehi, F. On the graphs with minimum Sombor index. MATCH Commun. Math. Comput. Chem. 2022, 88, 553–559. [Google Scholar] [CrossRef]
  2. Albalahi, A. M.; Alanazi, A. M.; Alotaibi, A. M.; Hamza, A. E.; Ali, A. Optimizing the Euler-Sombor index of (molecular) tricyclic graphs. MATCH Commun. Math. Comput. Chem. 2025, 94, 549–560. [Google Scholar] [CrossRef]
  3. Alidadi, A.; Parsian, A.; Arianpoor, H. The minimum Sombor index for unicyclic graphs with fixed diameter. MATCH Commun. Math. Comput. Chem. 2022, 88, 561–572. [Google Scholar] [CrossRef]
  4. Albertson, M. O. The irregularity of a graph. Ars. Comb. 1997, 46, 219–225. [Google Scholar]
  5. Cardano, G. Ars Magna, Johann Petreius; Nuremberg, 1545. [Google Scholar]
  6. Barman, J.; Das, S. Chemical applicability of the hyperbolic Sombor index. Chem. Phys. Lett. 2025, 878, 142340. [Google Scholar] [CrossRef]
  7. Barman, J.; Das, S. Geometric approach to degree-based topological index: Hyperbolic Sombor index. MATCH Commun. Math. Comput. Chem. 2026, 95, 63–94. [Google Scholar]
  8. Chen, H. L.; Li, W. H.; Wang, J. Extremal values on the Sombor index of trees. MATCH Commun. Math. Comput. Chem. 2022, 87, 23–49. [Google Scholar]
  9. Cruz, R.; Rada, J. Extremal values of the Sombor index in unicyclic and bicyclic graphs. J. Math. Chem. 2021, 59, 1098–1116. [Google Scholar] [CrossRef]
  10. Cruz, R.; Rada, J.; Sigarreta, J. M. Sombor index of trees with at most three branch vertices. Appl. Math. Comput. 2021, 409, 126414. [Google Scholar] [CrossRef]
  11. Dorjsembe, S.; Buyantogtokh, L.; Gutman, I.; Horoldagva, B.; Réti, T. Irregularity of graphs. MATCH Commun. Math. Comput. Chem. 2023, 89, 371–388. [Google Scholar]
  12. Das, K. C.; Gutman, I. On Sombor index of trees. Appl. Math. Comput. 2022, 412, 126575. [Google Scholar] [CrossRef]
  13. Das, K. C.; Shang, Y. L. Some extremal graphs with respect to Sombor index. Mathematics 2021, 9, 1202. [Google Scholar] [CrossRef]
  14. Fang, X. N.; You, L. H.; Liu, H. C. The expected values of Sombor indices in random hexagonal chains, phenylene chains and Sombor indices of some chemical graphs. Int. J. Quantum Chem. 2021, 121, e26740. [Google Scholar] [CrossRef]
  15. Gutman, I.; Trinajstić, N. Graph theory and molecular orbitals. Total π-electron energy of alternant hydrocarbons. Chem. Phys. Lett. 1972, 17, 535–538. [Google Scholar] [CrossRef]
  16. Gutman, I. Degree-based topological indices. Croat. Chem. Acta 2013, 86, 351–361. [Google Scholar] [CrossRef]
  17. Gutman, I. Sombor index — one year later. Bull. Acad. Serb. Sci. Arts 2020, 153, 43–55. [Google Scholar]
  18. Gutman, I. Geometric approach to degree-based topological indices: Sombor indices. MATCH Commun. Math. Comput. Chem. 2021, 86, 11–16. [Google Scholar]
  19. Gutman, I. Some basic properties of Sombor indices. Open J. Discr. Appl. Math. 2021, 4, 1–3. [Google Scholar] [CrossRef]
  20. Gutman, I. Relating Sombor and Euler indices. Mil. Tech. Cour. 2024, 71, 1–12. [Google Scholar] [CrossRef]
  21. Gutman, I.; Furtula, B.; Oz, M. S. Geometric approach to vertex degree-based topological indices–Elliptic Sombor index, theory and application. Int. J. Quantum Chem. 2024, 124, e27346. [Google Scholar] [CrossRef]
  22. Gutman, I.; Redžepović, I.; Kizilirmak, G. Özkan; Kulli, V. R. Euler–Sombor index and its congeners. Open J. Math. Sci. 2025, 9, 141–148. [Google Scholar] [CrossRef]
  23. Gutman, I.; Kulli, V. R.; Redžepović, I. Irregularity Sombor index. Bull. Serb. Acad. Sci. Arts (Class Math.) 2023, 156, 31–37. [Google Scholar]
  24. Gutman, I. Survey of Sombor-Type Degree-Based Topological Indices. MATCH Commun. Math. Comput. Chem. 2026, 96, 819–837. [Google Scholar] [CrossRef]
  25. Hu, Y.; Fang, J.; Liu, Y.; Lin, Z. Bounds on the Euler Sombor index of maximal outerplanar graphs. Electron. J. Math. 2024, 8, 39–47. [Google Scholar] [CrossRef]
  26. Khanra, B.; Das, S. Euler Sombor index of trees, unicyclic and chemical graphs. MATCH Commun. Math. Comput. Chem. 2025, 94, 525–548. [Google Scholar] [CrossRef]
  27. Kizilirmak, G. O. On the Euler Sombor index of tricyclic graphs. MATCH Commun. Math. Comput. Chem. 2025, 94, 247–262. [Google Scholar] [CrossRef]
  28. Kulli, V. R. Graph indices. In Handbook of Research of Advanced Applications of Graph Theory in Modern Society; Pal, M., Samanta, S., Pal, A., Eds.; Global: Hershey, 2020. [Google Scholar]
  29. Kulli, V. R. F-Sombor and modified F-Sombor indices of certain nanotubes. Ann. Pure Appl. Math. 2023, 27, 13–17. [Google Scholar] [CrossRef]
  30. Li, S.; Wang, Z.; Zhang, M. On the extremal Sombor index of trees with a given diameter. Appl. Math. Comput. 2022, 416, 126741. [Google Scholar] [CrossRef]
  31. Liu, H.; Chen, H.; Xiao, Q.; Fang, X.; Tang, Z. More on Sombor indices of chemical graphs and their applications to the boiling point of benzenoid hydrocarbons. Int. J. Quantum Chem. 2021, 121, e26689. [Google Scholar] [CrossRef]
  32. Liu, H.; Gutman, I.; You, L.; Huang, Y. Sombor index: review of extremal results and bounds. J. Math. Chem. 2022, 60, 771–798. [Google Scholar] [CrossRef]
  33. Liu, H.; You, L.; Huang, Y. Extremal Sombor indices of tetracyclic (chemical) graphs. MATCH Commun. Math. Comput. Chem. 2022, 88, 573–581. [Google Scholar] [CrossRef]
  34. Qi, F.; Lin, Z. Maximal elliptic Sombor index of bicyclic graphs. Contrib. Math. 2024, 10, 25–29. [Google Scholar] [CrossRef]
  35. Rada, J.; Rodriguez, J. M.; Sigarreta, J. M. General properties on Sombor indices. Discret. Appl. Math. 2021, 299, 87–97. [Google Scholar] [CrossRef]
  36. Rada, J.; Rodriguez, J. M.; Sigarreta, J. M. Extremal results on the general hyperbolic Sombor index. Discret. Appl. Math. 2026, 386, 388–399. [Google Scholar] [CrossRef]
  37. Rada, J.; Rodriguez, J. M.; Sigarreta, J. M. Sombor index and elliptic Sombor index of benzenoid systems. Appl. Math. Comput. 2024, 475, 128756. [Google Scholar] [CrossRef]
  38. Rada, J.; Rodriguez, J. M.; Sigarreta, J. M. Optimization problems for general elliptic Sombor index. MATCH Commun. Math. Comput. Chem. 2025, 93, 819–838. [Google Scholar]
  39. Redžepović, I. Chemical applicability of Sombor indices. J. Serb. Chem. Soc. 2021, 86, 445–457. [Google Scholar] [CrossRef]
  40. Réti, T.; Došlić, T.; Ali, A. On the Sombor index of graphs. Contrib. Math. 2021, 3, 11–18. [Google Scholar] [CrossRef]
  41. Song, R.; Liu, S.; Ou, J. On the second atom-bond connectivity index of product graphs. Ars. Comb. 2019, 142, 3–11. [Google Scholar] [CrossRef]
  42. Song, R.; Liu, S.; Ou, J.; Cui, J. On bicyclic graphs with maximal Graovac-Ghorbani index. MATCH Commun. Math. Comput. Chem. 2025, 91, 513–532. [Google Scholar]
  43. Su, Z.; Tang, Z. Extremal unicyclic and bicyclic graphs of the Euler Sombor index. AIMS Math. 2025, 10, 6338–6354. [Google Scholar] [CrossRef]
  44. Sun, X.; Du, J. On Sombor index of trees with fixed domination number. Appl. Math. Comput. 2022, 421, 126946. [Google Scholar] [CrossRef]
  45. Tache, A. P.; Tache, R. M.; Stroe, I. Extremal unicyclic graphs for the Euler Sombor index. MATCH Commun. Math. Comput. Chem. 2025, 94, 561–578. [Google Scholar] [CrossRef]
  46. Tang, Z.; Li, Y.; Deng, H. Elliptic Sombor index of trees and unicyclic graphs. Electron. J. Math. 2024, 7, 19–34. [Google Scholar] [CrossRef]
  47. Tang, Z.; Li, Y.; Deng, H. The Euler Sombor index of a graph. Int. J. Quantum Chem. 2024, 124, e27387. [Google Scholar] [CrossRef]
  48. Todeschini, R.; Consonni, V. Molecular Descriptors for Chemoinformatics; Wiley–VCH: Weinheim, 2009. [Google Scholar]
  49. Wang, Z.; Mao, Y.; Li, Y.; Furtula, B. On relations between Sombor and other degree-based indices. J. Appl. Math. Comput. 2022, 68, 1–17. [Google Scholar]
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

© 2026 MDPI (Basel, Switzerland) unless otherwise stated

Accessibility

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings