ZAGREB ECCENTRICITY INDICES OF CYCLES RELATED GRAPHS
Küçük Resim Yok
Tarih
2016
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
Charles Babbage Res Ctr
Erişim Hakkı
info:eu-repo/semantics/closedAccess
Özet
Graph 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.
Açıklama
Anahtar Kelimeler
Connectivity, Graph vulnerability, Zagreb indices, Eccentricity, Gear graph, Friendship graph, Corona graph, Algorithm
Kaynak
Ars Combinatoria
WoS Q Değeri
Q4
Scopus Q Değeri
Cilt
125
