@article {
author = {Adeel, Shamaila and Bhatti, Akhlaq Ahmad},
title = {On the extremal total irregularity index of n-vertex trees with fixed maximum degree},
journal = {Communications in Combinatorics and Optimization},
volume = {6},
number = {1},
pages = {113-121},
year = {2021},
publisher = {Azarbaijan Shahid Madani University},
issn = {2538-2128},
eissn = {2538-2136},
doi = {10.22049/cco.2020.26965.1168},
abstract = {In 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,v\in 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.},
keywords = {Irregularity,total irregularity index,maximal degree,molecular trees,integer linear programming problem},
url = {http://comb-opt.azaruniv.ac.ir/article_14102.html},
eprint = {http://comb-opt.azaruniv.ac.ir/article_14102_142e6efb502f59a1a401d057893b27df.pdf}
}