Extremal Degree Irregularity Bounds for Albertson and Sigma Indices in Trees and Bipartite Graphs

In this paper, study of extreme values of bounds in topological indices plays an important role in determining the impact of these indices on trees and bipartite graphs. For any integers $α, p$ where $1\leq p\leq α\leq Δ-3$, the upper bound of the minimum value of Albertson index $\operatorname{irr}_{\min}$ satisfy: \[ \operatorname{irr}_{\min}\geqslant Δ^2(Δ-1)\frac{2^α}{(Δ-p)^2}. \] Studies the maximum and minimum values of the Albertson index in bipartite graphs based on the sizes of their bipartition sets. Leveraging a known corollary, explicit formulas and bounds are derived that characterize the irregularity measure under various vertex size conditions. Upper bounds for both the Albertson and Sigma indices are established using graph parameters such as degrees and edge counts. Theoretical results are supported by examples and inequalities involving degree sequences, enhancing understanding of extremal irregularity behavior in bipartite graphs.