![Sample our Mathematics & Statistics journals, sign in here to start your FREE access for 14 days]({"type":"image" , "src" : "/sda/5943/TOC-Subject-Sample-2021-Mathematics-Statistics.jpg"})
Let G(V, E) be a graph. Throughout this paper, we use the notions of edge irregular total k-labeling and total edge irregularity strength of G (tes (G)). We verify tes of general uniform cactus chain graphs 
having (n - 2)r pendant vertices and length r. The result obtained is as follows: 
for n ≥ 6.
Subject Classification:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
To request a reprint or corporate permissions for this article, please click on the relevant link below:
Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?
Obtain permissions instantly via Rightslink by clicking on the button below:
If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.
