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 ... -
On the injective chromatic number of splitting graph and shadow graph of certain regular and biregular graphs
C. K., Bhanupriya; M. S., Sunitha (Işık University Press, 2025-01)The injective chromatic number of a graph G, denoted by χi(G) is the minimum number of colors needed to color the vertices of G such that two vertices with a common neighbor are assigned distinct colors. The splitting graph ... -
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 ...