Eccentric Connectivity Index of Certain Graphs

R. S. Haoe, K. A. Atan1, A. M. Khalaf2
1Institute for Mathematical Research, University Putra Malaysia 43400 Serdang, Selangor, Malaysia
2Department of Mathematics, Faculty of Computer Sciences and Mathematics, University Of Kufa, Najaf, Iraq

Abstract

The eccentric connectivity index of the molecular graph \(G\) was proposed by Sharma, Goswami, and Madan in 1997 \cite{17}. This index is defined as \(\xi^c(G) = \sum_{v\in V(G)} \deg(v) \, ec(v)\), where \(\deg(v)\) is the degree of vertex \(v\) in \(G\) and eccentricity \(ec(v)\) is the largest distance between \(v\) and any other vertex of \(G\). 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