THE UPPER BOUNDS FOR MULTIPLICATIVE SUM ZAGREB INDEX OF SOME GRAPH OPERATIONS
Küçük Resim Yok
Tarih
2017
Yazarlar
Dergi Başlığı
Dergi ISSN
Cilt Başlığı
Yayıncı
ELEMENT
Erişim Hakkı
info:eu-repo/semantics/openAccess
Özet
Let G be a simple graph with vertex set V(G) and edge set E(G). In [7], Eliasi et al. introduced the multiplicative sum Zagreb index of a graph G which is denoted by Pi(*)(1) (G) and is defined by Pi(*)(1)(G) = Pi(uv epsilon V(G)) (d(G)(u) + d(G)(v)) In this paper, we present some upper bounds for the multiplicative sum Zagreb indices of the join, rooted product, corona product, tensor product, Cartesian product, strong product, hierarchical product, lexicographic product of graphs.
Açıklama
Anahtar Kelimeler
Zagreb indices, multiplicative sum Zagreb index, join, rooted product, corona product, tensor product, cartesian product, strong product, hierarchical product, lexicographic product
Kaynak
JOURNAL OF MATHEMATICAL INEQUALITIES
WoS Q Değeri
Q2
Scopus Q Değeri
Q2
Cilt
11
Sayı
3
