# IJPAM: Volume 106, No. 1 (2016)

**ECCENTRIC CONNECTIVITY INDEX OF**

SOME CHEMICAL TREES

SOME CHEMICAL TREES

Department of Mathematics

Faculty of Computer Science and Mathematics

University of Kufa

Najaf, IRAQ

Institute for Mathematical Research

Universiti Putra Malaysia

43400 Serdang, Selangor, MALAYSIA

Department of Mathematics

Faculty of Science and Technology

University Malaysia Terengganu

21030 UMT Terengganu, MALAYSIA

**Abstract. **Let be a simple connected molecular graph. In such a simple molecular graph, vertices represent atoms and edges represent chemical bonds, we denoted the sets of vertices and edges by and , respectively. If be the notation of distance between vertices
and is defined as the length of a shortest path connecting them.Then, the eccentricity connectivity index of a molecular graph is defined as
, where is degree of a vertex , and is defined as the number of adjacent vertices with . is eccentricity of a vertex , and is defined as the length of a maximal path connecting to another vertex of . In this paper, we establish the general formulas for the eccentricity connectivity index of some classes of chemical trees.

**Received: **September 18, 2015

**AMS Subject Classification: **92E10

**Key Words and Phrases: **eccentric connectivity index, eccentricity, chemical trees

**Download paper from here.**

**DOI: 10.12732/ijpam.v106i1.12**

International Journal of Pure and Applied Mathematics

**How to cite this paper?****Source:****ISSN printed version:**1311-8080

**ISSN on-line version:**1314-3395

**Year:**2016

**Volume:**106

**Issue:**1

**Pages:**157 - 170

Google Scholar; DOI (International DOI Foundation); WorldCAT.

**This work is licensed under the Creative Commons Attribution International License (CC BY).**