Bounds of Rede ned Zagreb indices for F-Sum of Graphs, F = Q or T

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

Full metadata record

DC Field	Value	Language
dc.contributor.author	KANWAL, SALMA	-
dc.contributor.author	MANZOOR, AYESHA	-
dc.contributor.author	ASHRAF, REHANA	-
dc.contributor.author	RAUF, ASIA	-
dc.contributor.author	Malik, Dr. Shabnam	-
dc.contributor.author	SUMBAL, TAHIRA	-
dc.date.accessioned	2022-04-21T06:53:01Z	-
dc.date.available	2022-04-21T06:53:01Z	-
dc.date.issued	2021	-
dc.identifier.uri	http://localhost:8080/xmlui/handle/123456789/1507	-
dc.description.abstract	Rede ned Zagreb indices are new graph invariants, which is the degree based topological index ReZG1(G) = Σ uv2E(G) du+dv dudv , ReZG2(G) = Σ uv2E(G) dudv du+dv and ReZG3(G) = Σ uv2E(G)(dudv) (du + dv). Eliasi and Taeri introduced four new operations based on graphs S(G), R(G), Q(G) and T(G), which are also known as F- sum of graphs, where F= S, Q, R and T. In this paper, we establish bounds of the rede ned Zagreb indices for for F-Sum of Graphs, where F = Q or T.	en_US
dc.language.iso	en_US	en_US
dc.subject	Distance(in graphs), Rede ned Za- greb indices, Operations on graphs, Subdivision of graph, Total graph.	en_US
dc.title	Bounds of Rede ned Zagreb indices for F-Sum of Graphs, F = Q or T	en_US
Appears in Collections:	Mathematics Department

Files in This Item:

File	Description	Size	Format
4-Ars Comb. 155 (2021), 107-133.pdf		123.21 kB	Adobe PDF	View/Open

DSpace JSPUI