>
Fa   |   Ar   |   En
   on the extremal total irregularity index of n-vertex trees with fixed maximum degree  
   
نویسنده yousaf shamaila ,bhatti akhlaq ahmad
منبع communications in combinatorics and optimization - 2021 - دوره : 6 - شماره : 1 - صفحه:113 -121
چکیده    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.
کلیدواژه irregularity ,total irregularity index ,maximal degree ,molecular trees ,in-teger linear programming problem
آدرس national university of computer and emerging sciences, lahore campus, department of sciences and humanities, pakistan. university of gujrat, hafiz hayat campus, department of mathematics, pakistan, national university of computer and emerging sciences, lahore campus, department of sciences and humanities, pakistan
پست الکترونیکی akhlaq.ahmad@nu.edu.pk
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved