The eccentric atom-bond sum-connectivity \(\left(ABSC_{e}\right)\) index of a graph \(G\) is defined as \(ABSC_{e}(G)=\sum\limits_{uv\in E(G)}\sqrt{\frac{e_{u}+e_{v}-2}{e_{u}+e_{v}}}\), where \(e_{u}\) and \(e_{v}\) represent the eccentricities of \(u\) and \(v\) respectively. This work presents precise upper and lower bounds for the \(ABSC_{e}\) index of graphs based on their order, size, diameter, and radius. Moreover, we find the maximum and minimum \(ABSC_{e}\) index of trees based on the specified matching number and the number of pendent vertices.
