Sharp Bounds and Extremal Properties of a Degree-Based Graph Irregularity Index
We study the degree-contrast index DCI(G) = ∑︁ uv∈E(G) (d(u)d(v)) 2 /(d(u) + d(v)), an irregularity measure that vanishes on a connected graph exactly when the graph is regular.The identity DCI = M 1 -4 ISI shows that it is a derived combination of the first Zagreb and inverse sum indeg indices; our contribution is the theory built on it.We prove the sigma-index bounds σ/(2∆) ≤ DCI ≤ σ/(2δ), strict for non-regular graphs with asymptotically optimal constants, and the sharp bounds σ/(2∆ -1) ≤ DCI ≤ σ/(2δ + 1), characterising all equality cases.We give closed forms for fourteen standard graph families, indexed by their order n.For complete split graphs we prove c * n 3 -3 2 n 2 ≤ max k DCI(CS(n, k)) < c * n 3 with c * = (632-238 √ 7)/27 ≈ 0.0856, whereas stars, wheels and friendship graphs grow only quadratically, and we show that the maximum of DCI over connected graphs of order n is Θ(n 3 ).Exhaustive enumeration in exact arithmetic shows that the unique maximiser is the star for 4 ≤ n ≤ 7 and the complete split graph CS(n, 2) for 8 ≤ n ≤ 10.
Publication Details
- Journal
- Journal of contemporary applied mathematics.
- Published
- 2026-11-19
- DOI
- https://doi.org/10.62476/jcam181.2
- Primary Topic
- Graph theory and applications
- Type
- article
- Field-Weighted Citation Impact
- 0.00