On the minimal eccentric connectivity indices of graphs

@article{Zhang2012OnTM,
  title={On the minimal eccentric connectivity indices of graphs},
  author={Jianbin Zhang and Bo Zhou and Zhongzhu Liu},
  journal={Discrete Mathematics},
  year={2012},
  volume={312},
  pages={819-829}
}
Let G be a simple connected graph. The eccentric connectivity index ξ c(G) of G is defined as ξ c(G) = ∑ v∈V (G) d(v)ecG(v), where the eccentricity ecG(v) is the largest distance between v and any other vertex u ofG. In this paper, we obtain lower bounds on ξ c(G) in terms of the number of edges among n-vertex connected graphs with given diameter. Over… CONTINUE READING