On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks

Salma Kanwal, Ayesha Riasat, Muhammad Kamran Siddiqui, Shabnam Malik, Khadija Sarwar, Afzal Ammara, Asare-Tuah Anton and Baltazar Aguirre Hernandez

Complexity, 2021, vol. 2021, 1-32

Abstract: Kragujevac tree is indicated by K; K∈Kgq=s2t+1+1,s with order and size s2t+1+1 and s2t+1, respectively. In this paper, we have a look at certain topological features of the total graph and line graph of the total graph of the considered tree, i.e., Kragujevac tree, by computing different topological indices and polynomials.

Date: 2021
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/complexity/2021/8695121.pdf (application/pdf)
http://downloads.hindawi.com/journals/complexity/2021/8695121.xml (application/xml)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:hin:complx:8695121

DOI: 10.1155/2021/8695121

Access Statistics for this article

More articles in Complexity from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().