The modied eccentric connectivity index of a graph is dened as the sum of the products of eccentricity with the total degree of neighboring vertices, over all vertices of the graph. This is a generalization of eccentric connectivity index. In this paper, we derive some upper and lower bounds for the modied eccentric connectivity index in terms of some graph parameters such as number of vertices, number of edges, radius, minimum degree, maximum degree, total eccentricity, the rst and
['Nilanjan De', 'Sk. Md. Abu Nayeem', 'Anita Pal']
BOUNDS FOR THE MODIFIED ECCENTRIC CONNECTIVITY INDEX