Skip to content
Open access

The Contrastive Sombor Index: Structural Properties and Applications to Monogenic Semigroup Graphs

Jul 2026 · Symmetry · Vol 18, pp. 1258 · 0 citations · 13 references

Abstract

The Sombor index has recently become a central tool among degree-based graph invariants; however, it does not explicitly isolate degree imbalance along edges. In this work, we introduce the degree-based Contrastive Sombor Index (CSO), which combines endpoint-degree magnitude with local degree imbalance. For a finite simple graph G=(V,E), the index is defined by CSO(G)=∑uv∈E(G)d(u)2+d(v)2−2min{d(u),d(v)}. Unlike the Sombor index, which primarily reflects the magnitude of the endpoint degrees, the CSO contribution vanishes when the endpoint degrees are equal and responds to degree imbalance while retaining degree-scale information. In particular, it can distinguish certain graphs having the same total edgewise irregularity but different endpoint-degree distributions. In this work, we first show that CSO(G)≥0 and prove that CSO(G)=0 if and only if each connected component of G is regular. We also establish general lower and upper bounds for CSO. In addition, we obtain a relation connecting the CSO index with the first Zagreb index and the edgewise degree differences. We also discuss extremal aspects of the index. As an application, we derive an explicit summation formula for CSO on monogenic semigroup graphs. From our computations on Γ(SM), it follows that the asymptotic growth order of the index satisfies CSO(Γ(SM))=Θ(n3). These results show that the CSO index combines degree-magnitude information with sensitivity to unequal endpoint degrees and provides an additional perspective on degree heterogeneity in graphs.

Read PDF

Similar papers

Open access Aug 2026

Degree-Ratio Sombor Index

The degree-ratio Sombor (DRSO) index is a recently introduced variant of the extensively studied Sombor index. In this paper, we establish an upper bound on the DRSO index in terms of the size, minimum degree, and maximum degree of a graph, which provides the unique graph maximizing the DRSO index among all fixed-order...

Akbar Ali, Ivan Gutman, Gasper George Nyauli et al. · 0 citations
Open access Aug 2026

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

The Hyperbolic Sombor index HSO(G) of a graph G=(V(G),E(G)) is proposed as a new vertex-degree-based topological index. 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...

Wei-Peng Zhang, Saihua Liu, Rui Song · 0 citations
Open access Aug 2026

On the Degree-Ratio Sombor Index: Corrections and New Bounds

The degree-ratio Sombor index (DRSO) is a recently introduced geometric degree-based topological invariant. First, we correct an erroneous lower bound involving the Sombor index and rectify the characterization of extremal graphs from the original work on this index [11]. Subsequently, we investigate the relationship b...

Zhou-Jian Shao, A. Jahanbani · 0 citations
Open access Aug 2026

Maximum Sombor Index and Spectral Radius of Hypertrees

This work investigates the extremal structural properties of uniform hypertrees with respect to the Sombor index and the Sombor spectral radius, two degree-based measures that capture nonlinear connectivity patterns.

Shashwath S. Shetty, K. Bhat · 0 citations
Open access Aug 2026

Functional Quantum Calculus Approach to Degree-Based Topological Indices in Chemical Graph Theory

In this research article, we replace the integer degree n = deg(v) of a vertex by its q(t)-analogue [n]q(t) and by an h(t)-analogue ⟨n⟩h(t) obtained from the h(t)-derivative of x n at x = 1, and we show that every classical degree-based index TI(G) = ∑︁uv∈E(G) F(deg u, deg v) admits two functional companions TIq(t)(G)...

Shrinath Manjarekar · 0 citations
Open access Sep 2026

Lower Bounds on the Eccentric Connectivity Index in Terms of the Irregularity Index

Let G be a connected simple graph of order n≥3, and let ξc(G)=∑v∈V(G)ecG(v)degG(v) denote its eccentric connectivity index. We study the lower bounds for ξc(G) in terms of the irregularity index t(G), defined as the number of distinct vertex degrees of G. For t=t(G)≥2, we prove that ξc(G)≥3n+t2−3t−1, which reduces to t...

Moster Zhangazha, S. Mukwembi, F. Nyabadza · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.