>
Fa   |   Ar   |   En
   ECCENTRIC CONNECTIVITY INDEX AND ECCENTRIC DISTANCE SUM OF SOME GRAPH OPERATIONS  
   
نویسنده وومار الکین ,اسکندر بوزوهراگول
منبع transactions on combinatorics - 2013 - دوره : 2 - شماره : 1 - صفحه:103 -111
چکیده    Let g = (v;e) be a connected graph. the eccentric connectivity index of g, c(g),is defined as c(g) = pv2v (g) deg(v)ec(v), where deg(v) is the degree of a vertex v and ec(v) isits eccentricity. the eccentric distance sum of g is defined as d(g) = pv2v (g) ec(v)d(v), whered(v) = pu2v (g) d(u; v). in this paper, we calculate the eccentric connectivity index and eccentricdistance sum of generalized hierarchical product of graphs. moreover, we present the exact formulaefor the eccentric connectivity index of f-sum graphs in terms of some invariants of the factors.
کلیدواژه Eccentric connectivity index ,eccentric distance sum ,generalized hierarchical product ,F-sum graphs
آدرس Xinjiang University, College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P R China, China, Xinjiang University, College of Mathematics and System Sciences, Xinjiang University, Urumqi 830046, P R China, China
پست الکترونیکی buzoragul2005@163.com
 
     
   
Authors
  
 
 

Copyright 2023
Islamic World Science Citation Center
All Rights Reserved