The eccentric connectivity index of the molecular graph was proposed by Sharma, Goswami, and Madan in 1997 \cite{17}. This index is defined as , where is the degree of vertex in and eccentricity is the largest distance between and any other vertex of . Thus, in this paper, we established the general formulas for the eccentric connectivity index of joining a special graph to its paths and of joining two different graphs by a path. Proofs were also provided.
Keywords: Eccentric Connectivity Index, Eccentricity, Special graphs. 1.Introduction