Computing Ediz Eccentric Connectivity Index of an Infinite Class of Nanostar Dendrimers

dc.contributor.author Ediz, S.
dc.date.accessioned 2025-05-10T17:48:01Z
dc.date.available 2025-05-10T17:48:01Z
dc.date.issued 2010
dc.description Ediz, Suleyman/0000-0003-0625-3634 en_US
dc.description.abstract Let G be a molecular graph, we firstly define Ediz eccentric connectivity index as (E)xi(c) (G) = Sigma(n)(i=1) (S(i)/E(i)) where S(i) is the sum of degrees of all vertices v(j), adjacent to vertex v(i), E(i). is the largest distance between v(i) and any other vertex v(k) of G or the eccentricity of v(i) 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. en_US
dc.identifier.issn 1842-6573
dc.identifier.uri https://hdl.handle.net/20.500.14720/16951
dc.language.iso en en_US
dc.publisher Natl inst Optoelectronics en_US
dc.rights info:eu-repo/semantics/closedAccess en_US
dc.subject Ediz Eccentric Connectivity Index en_US
dc.subject Eccentricity en_US
dc.subject Dendrimer en_US
dc.title Computing Ediz Eccentric Connectivity Index of an Infinite Class of Nanostar Dendrimers en_US
dc.type Article en_US
dspace.entity.type Publication
gdc.author.id Ediz, Suleyman/0000-0003-0625-3634
gdc.author.institutional Ediz, S.
gdc.author.wosid Ediz, Suleyman/V-5386-2017
gdc.coar.access metadata only access
gdc.coar.type text::journal::journal article
gdc.description.department T.C. Van Yüzüncü Yıl Üniversitesi en_US
gdc.description.departmenttemp Yuzuncu Yil Univ, Dept Math, Van, Turkey en_US
gdc.description.endpage 1848 en_US
gdc.description.issue 11 en_US
gdc.description.publicationcategory Makale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanı en_US
gdc.description.scopusquality Q4
gdc.description.startpage 1847 en_US
gdc.description.volume 4 en_US
gdc.description.woscitationindex Science Citation Index Expanded
gdc.description.wosquality Q4
gdc.identifier.wos WOS:000285399400052
gdc.index.type WoS

Files