Title of article :
on the extremal total irregularity index of n-vertex trees with fixed maximum degree
Author/Authors :
yousaf, shamaila national university of computer and emerging sciences, lahore campus - department of sciences and humanities, lahore, pakistan , yousaf, shamaila university of gujrat, hafiz hayat campus - department of mathematics, gujrat, pakistan , bhatti, akhlaq ahmad national university of computer and emerging sciences, lahore campus - department of sciences and humanities, lahore, pakistan
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 irrt(g)=1/2∑u,v∈v(g)|du−dv|, where du denotes the vertex degree of a vertex u∈v(g). in this paper, we investigate the total irregularity of trees with bounded maximal degree δ 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 , in , teger linear programming problem
Journal title :
Communications in Combinatorics and Optimization
Journal title :
Communications in Combinatorics and Optimization
