\(^{1}\) Blockchain Laboratory of Agricultural Vegetables, Weifang University of Science and Technology, Shouguang, 262700, China
Received: 12/03/2023
Revised: 03/09/2023
Accepted: 13/09/2023
Published: 21/09/2023
Abstract
A graph is a particular representation of a static network and labeling of a graph can be think of as automatic routing of data in a network topology. A visual representation of data in the form of a graph help us to look deep insight. The data science (e.g., Python Package: a computer programming language) uses graph theory concepts to study and analyze the networks. Analyzing these network is equivalent of finding a set of edges E′ for a graph G such that every vertex of G is incident with at least one edge in E′. Then E′ is called an edge-covering of G. A spanning tree of a connected graph is an example of edge-covering. A finite simple graph G is an (ad, d)-H-antimagic if the following three conditions are satisfied: G has an H-covering (H a subgraph of G), there exists a bijection α : V (G) ∪ E(G) → {1, 2, 3, . . . , |V (G) ∪ E(G)|} and the H-weights constitute an arithmetic progression with common difference d. The above said labeling is called super if α(V ) = {1, 2, . . . , |V |}. In this research article, we focused on studying super C3-antimagic labeling of line graph of a sun-let graph for several differences and C3-supermagic labeling of its disjoint union.
