The edge eccentric connectivity index of hexagonal cactus chains

Basit Öğe Kaydı
dc.contributor.authorTuraci, T.
dc.contributor.authorÖkten, M.
dc.date.accessioned2024-09-29T16:16:37Z
dc.date.available2024-09-29T16:16:37Z
dc.date.issued2015
dc.departmentKarabük Üniversitesien_US
dc.description.abstractThe chemical graph theory is an important branch of mathematical chemistry. In this branch, there are many Topological Indexes. Let G = (V, E) be a simple molecular graph without directed and multiple edges and without loops, the vertex and edge sets of which are represented by V = (V, G) and E =EG, respectively. The edge eccentric connectivity index of G, denoted by c eG is defined by c eG = f?E (G) f deg Gf where (G) is eccentricity value and degGf is degree of an edge f in the graph G. In this paper, edge eccentric connectivity index of hexagonal cactus chains namely para-chain Ln, ortho-chain On and meta-chain Mn are determined. Copyright © 2015 American Scientific Publishers.en_US
dc.identifier.doi10.1166/jctn.2015.3996
dc.identifier.endpage3980en_US
dc.identifier.issn1546-1955
dc.identifier.issue10en_US
dc.identifier.scopus2-s2.0-84960172811en_US
dc.identifier.scopusqualityQ4en_US
dc.identifier.startpage3977en_US
dc.identifier.urihttps://doi.org/10.1166/jctn.2015.3996
dc.identifier.urihttps://hdl.handle.net/20.500.14619/9218
dc.identifier.volume12en_US
dc.indekslendigikaynakScopusen_US
dc.language.isoenen_US
dc.publisherAmerican Scientific Publishersen_US
dc.relation.ispartofJournal of Computational and Theoretical Nanoscienceen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectDistanceen_US
dc.subjectEccentricityen_US
dc.subjectEdge Eccentric Connectivity Indexen_US
dc.subjectHexagonal Cactus Chainsen_US
dc.titleThe edge eccentric connectivity index of hexagonal cactus chainsen_US
dc.typeArticleen_US

Dosyalar

Koleksiyon

Scopus İndeksli Yayınlar Koleksiyonu