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

Please use this identifier to cite or link to this item: http://digitalrepository.fccollege.edu.pk/handle/123456789/1506

Full metadata record

DC Field	Value	Language
dc.contributor.author	Kanwal, Salma	-
dc.contributor.author	Riasat, Ayesha	-
dc.contributor.author	Siddiqui, Muhammad Kamran	-
dc.contributor.author	Malik, Shabnam	-
dc.contributor.author	Sarwar, Khadija	-
dc.contributor.author	Ammara, Afzal	-
dc.contributor.author	Anton, Asare-Tuah	-
dc.date.accessioned	2022-04-21T06:45:06Z	-
dc.date.available	2022-04-21T06:45:06Z	-
dc.date.issued	2021-11-18	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1506	-
dc.description.abstract	Kragujevac tree is indicated by K; K ∈ Kgq�s(2t+1)+1,s with order and size s(2t + 1) + 1 and s(2t + 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.	en_US
dc.language.iso	en_US	en_US
dc.publisher	Hindawi Complexity Volume 2021, Article ID 8695121, 32 pages https://doi.org/10.1155/2021/8695121	en_US
dc.title	On Topological Indices of Total Graph and Its Line Graph for Kragujevac Tree Networks	en_US
Appears in Collections:	Mathematics Department

Files in This Item:

File	Description	Size	Format
3-Hindawi Complexity (2021), 8695121.pdf		4.54 MB	Adobe PDF	View/Open

DSpace JSPUI