Azarbaijan Shahid Madani UniversityCommunications in Combinatorics and Optimization2538-21286120210601On the extremal total irregularity index of n-vertex trees with fixed maximum degree1131211410210.22049/cco.2020.26965.1168ENShamailaAdeelFast NUCES, Lahore, Pakistan.0000-0003-2732-6601Akhlaq AhmadBhattiFast NUCES, Lahore, Pakistan.Journal Article20200829In the extension of irregularity indices, Abdo et. al. {[H. Abdo, S. Brandt, D. Dimitrov, The total irregularity of a graph, Discrete Math. Theor. Comput. Sci. 16 (2014), 201--206]} defined the total irregularity of a graph $G = (V,E)$ as $irr_{t}(G)= frac{1}{2} sum_{u,vin V(G)} big|d_u - d_v big| $, where $d_u $ denotes the vertex degree of a vertex $u in V(G)$. In this paper, we investigate the total irregularity of trees with bounded maximal degree $Delta$ and state integer linear programming problem which gives standard information about extremal trees and it also calculates the index.http://comb-opt.azaruniv.ac.ir/article_14102_142e6efb502f59a1a401d057893b27df.pdf