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.
RASHID FAROOQ1,* , MEHAR ALI MALIK1
Let G be a molecular graph. The distance between two vertices of G is the length of a shortest path connecting these two vertices. The eccentricity of a vertex u in G is the largest distance between u and any other vertex of G. In this paper, we consider some infinite families of nanostar dendrimers and compute their eccentric-connectivity index and totaleccentricity index. Furthermore, we also compute some eccentricity based Zagreb indices of these nanostar dendrimers..
Nanostar dendrimers, Eccentric-connectivity index, Total-eccentricity index, Eccentricity based Zagreb indices.
RASHID FAROOQ, MEHAR ALI MALIK, On some eccentricity based topological indices of nanostar dendrimers, Optoelectronics and Advanced Materials - Rapid Communications, 9, 5-6, May-June 2015, pp.842-849 (2015).
Submitted at: April 30, 2015
Accepted at: May 7, 2015
Optoelectronics and Advanced Materials - Rapid Communications
(2023): 0.5 - 2023 Journal Citation Reports (Clarivate Analytics, 2024)
Active accounts were imported to the new platform and assigned a random password by default. In order to access your account you need to access the login page and go through the Lost Password dialog (involves the system sending you an email with instructions) in order to reset your password. This step is necessary as passwords are kept in hashed form and the new platform uses modern hashing algorithms incompatible with the previous ones.