"

Cookies ussage consent

Our site saves small pieces of text information (cookies) on your device in order to deliver better content and for statistical purposes. You can disable the usage of cookies by changing the settings of your browser. By browsing our site without changing the browser settings you grant us permission to store that information on your device.

Computing Ediz eccentric connectivity index of an infinite class of nanostar dendrimers

S. EDİZ1,*

Affiliation

  1. Department of Mathematics, Yüzüncü Yıl University, Van, Turkey

Abstract

Let G be a molecular graph, we firstly define Ediz eccentric connectivity index as 1 ( ) n E c i i i S G E           where i S is the sum of degrees of all vertices j v , adjacent to vertex i v , i E is the largest distance between i v and any other vertex k v of G or the eccentricity of i v and n is the number of vertices in graph G. In this paper an exact formula for the Ediz eccentric connectivity index of an infinite class of nanostar dendrimers is given..

Keywords

Ediz eccentric connectivity index, Eccentricity, Dendrimer.

Citation

S. EDİZ, Computing Ediz eccentric connectivity index of an infinite class of nanostar dendrimers, Optoelectronics and Advanced Materials - Rapid Communications, 4, 11, November 2010, pp.1847-1848 (2010).

Submitted at: Oct. 11, 2010

Accepted at: Nov. 10, 2010