Tree-Antimagicness of Web Graphs and Their Disjoint Union

In graph theory, the graph labeling is the assignment of labels (represented by integers) to edges and/or vertices of a graph. For a graph G. (V, E), with vertex set V and edge set E, a function from V to a set of labels is called a vertex labeling of a graph, and the graph with such a function defined is called a vertex-labeled graph. Similarly, an edge labeling is a function of E to a set of labels, and in this case, the graph is called an edge-labeled graph. In this research article, we focused on studying super (a d, d)-T (4,2)-antimagic labeling of web graphs W(2, n) and isomorphic copies of their disjoint union.