ZAGREB ECCENTRICITY INDICES OF CYCLES RELATED GRAPHS

dc.authoridTURACI, TUFAN/0000-0002-6159-0935
dc.contributor.authorTuraci, Tufan
dc.date.accessioned2024-09-29T16:11:20Z
dc.date.available2024-09-29T16:11:20Z
dc.date.issued2016
dc.departmentKarabük Üniversitesien_US
dc.description.abstractGraph theory, with its diverse applications in theoretical computer science and in natural (Chemistry, Biology) in particular is becoming an important component of the mathematics. Recently, the concepts of new zagreb eccentricity indices were introduced. These indices were defined for any graph G, as follows: M-1*(G) = Sigma(euv is an element of E(G))[epsilon(G)(u) + epsilon(G)(v)] (G) = M-1**(G) = Sigma(v is an element of V)[epsilon(G)(v)](2) and M-2*(G) = Sigma(euv is an element of E(G))[epsilon(G)(u) epsilon(G)(v)], where epsilon(G)(u) is eccentricity value of vertex u in the graph G. In this paper, new zagreb eccentricity indices M-1*(G), M-1**(G) and M-2*(G) of cycles related graphs namely gear, friendship and corona graphs are determined. Then, a programming code finding values of new zagreb indices of any graph is offered.en_US
dc.identifier.endpage256en_US
dc.identifier.issn0381-7032
dc.identifier.startpage247en_US
dc.identifier.urihttps://hdl.handle.net/20.500.14619/8338
dc.identifier.volume125en_US
dc.identifier.wosWOS:000384960600021en_US
dc.identifier.wosqualityQ4en_US
dc.indekslendigikaynakWeb of Scienceen_US
dc.language.isoenen_US
dc.publisherCharles Babbage Res Ctren_US
dc.relation.ispartofArs Combinatoriaen_US
dc.relation.publicationcategoryMakale - Uluslararası Hakemli Dergi - Kurum Öğretim Elemanıen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectConnectivityen_US
dc.subjectGraph vulnerabilityen_US
dc.subjectZagreb indicesen_US
dc.subjectEccentricityen_US
dc.subjectGear graphen_US
dc.subjectFriendship graphen_US
dc.subjectCorona graphen_US
dc.subjectAlgorithmen_US
dc.titleZAGREB ECCENTRICITY INDICES OF CYCLES RELATED GRAPHSen_US
dc.typeArticleen_US

Dosyalar