On arithmetic-geometric index (GA) and edge GA index
Künye
Aytaç, V. & Turacı, T. (2018). On arithmetic-geometric index (GA) and edge GA index. TWMS Journal Of Applied And Engineering Mathematics, 8(1), 61-70.Özet
Let G(V (G), E(G)) be a simple connected graph and dG(u) be the degree of the vertex u. Topological indices are numerical parameters of a graph which are invariant under graph isomorphisms. Recently, people are studying various topological measures such as the arithmetic-geometric index and the edge version of arithmeticgeometric index of a graph G. Topological index based on the ratios of geometrical and arithmetical means of end vertex degrees of edges. In this paper, exact values for the arithmetic-geometric index and the edge version of arithmetic-geometric index of Wheel related graphs namely gear, helm, sunflower and friendship graph are obtained.
Cilt
8Sayı
1Bağlantı
http://belgelik.isikun.edu.tr/xmlui/handle/iubelgelik/2644http://jaem.isikun.edu.tr/web/index.php/archive/97-vol8no1/322
Koleksiyonlar
Aşağıdaki lisans dosyası bu öğe ile ilişkilidir:
İlgili Öğeler
Başlık, yazar, küratör ve konuya göre gösterilen ilgili öğeler.
-
Balanced rank distribution labeling of ladder graphs, complete graphs and complete bipartite graphs
Hemalatha, Palanisamy; Gokilamani, S. (Işık University Press, 2021)A balanced rank distribution labeling of a graph G of order n is a new kind of vertex labeling from {1, 2, 3, ..., k}(n <= k is an element of Z(+)) which leads to a balanced edge labeling of G called edge ranks. In this ... -
Hub-integrity of splitting graph and duplication of graph elements
Mahde, Sultan Senan; Mathad, Veena (Işık University Press, 2016-01-08)The hub-integrity of a graph G = (V (G), E(G)) is denoted as HI(G) and defined by HI(G) = min{|S| + m(G ? S), S is a hub set of G}, where m(G ? S) is the order of a maximum component of G ? S. In this paper, we discuss ... -
Distance spectra of some graph operations and some new distance equienergetic graphs of diameter 3
Adiga, Chandrashekar; Rakshith, B. R.; Sumithra (Işık University Press, 2019)Two graphs of same order are said to be distance equienergetic if their distance energies are same. In this paper, we first give a partial insight on the distance spectrum of Mycielskian graphs and then we focus on ...