On certain topological indices of the derived graphs of subdivision graphs
Künye
Hosamani, S. M., Lokesha, V., Cangül, İ. N. & Devendraiah, K. M. (2016). On certain topological indices of the derived graphs of subdivision graphs. TWMS Journal of Applied and Engineering Mathematics, 6(2), 324-332.Özet
The derived graph [G]† of a graph G is the graph having the same vertex set as G, with two vertices of [G]† being adjacent if and only if their distance in G is two. Topological indices are valuable in the study of QSAR/QSPR. There are numerous applications of graph theory in the field of structural chemistry. In this paper, we compute generalized Randi´c, general Zagreb, general sum-connectivity, ABC, GA, ABC4, and GA5 indices of the derived graphs of subdivision graphs.
Kaynak
TWMS Journal of Applied and Engineering MathematicsCilt
6Sayı
2Bağlantı
https://hdl.handle.net/11729/2603http://jaem.isikun.edu.tr/web/index.php/archive/92-vol6no2/262
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 ... -
Degree equivalence graph of a graph
Rajendra, R.; Siva Kota Reddy, Polaepalli; Madhusudhan, Krishnarajapete Venkatarama (Işık University Press, 2020)Given a set S and an equivalence relation R on S, one can define an equivalence graph with vertex set S. Given a graph with vertex set V , we can define an equivalence relation on V using the concept of degree of a vertex ...