z-logo
open-access-imgOpen Access
On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks
Author(s) -
Salma Kanwal,
Ayesha Riasat,
Muhammad Kamran Siddiqui,
Shabnam Malik,
Khadija Sarwar,
Ammara Afzal,
Asare-Tuah Anton
Publication year - 2021
Publication title -
complexity
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.447
H-Index - 61
eISSN - 1099-0526
pISSN - 1076-2787
DOI - 10.1155/2021/8695121
Subject(s) - graph , combinatorics , mathematics , tree (set theory) , discrete mathematics
Kragujevac tree is indicated by K ; K ∈ K g q = s 2 t + 1 + 1 , s with order and size s 2 t + 1 + 1 and s 2 t + 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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom