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 Research Centre
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 6, as follows: M(G) = euvEE(G)[EG(U) + EG(V)], M1'(G) = vev(G)[EG(v)]2 and M(G) = where EG(U) is eccentricity value of vertex if in the graph 0. In this paper, new zagreb eccentricity indices M(G), M'(G) and M (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. 2010 Mathematics Subject Classification: 05C40, 05C90.
Açıklama
Anahtar Kelimeler
Algorithm., Connectivity, Corona graph, Eccentricity, Friendship graph, Gear graph, Graph vulnerability, Zagreb indices
Kaynak
Ars Combinatoria
WoS Q Değeri
Scopus Q Değeri
Q4
Cilt
125
