Computing Edge Weights of Magic Labeling on Rooted Products of Graphs

Abstract EN

Labeling of graphs with numbers is being explored nowadays due to its diverse range of applications in the fields of civil, software, electrical, and network engineering.

For example, in network engineering, any systems interconnected in a network can be converted into a graph and specific numeric labels assigned to the converted graph under certain rules help us in the regulation of data traffic, connectivity, and bandwidth as well as in coding/decoding of signals.

Especially, both antimagic and magic graphs serve as models for surveillance or security systems in urban planning.

In 1998, Enomoto et al.

introduced the notion of super a,0 edge-antimagic labeling of graphs.

In this article, we shall compute super a,0 edge-antimagic labeling of the rooted product of Pn and the complete bipartite graph K2,m combined with the union of path, copies of paths, and the star.

We shall also compute a super a,0 edge-antimagic labeling of rooted product of Pn with a special type of pancyclic graphs.

The labeling provided here will also serve as super a′,2 edge-antimagic labeling of the aforesaid graphs.

All the structures discussed in this article are planar.

Moreover, our findings have also been illustrated with examples and summarized in the form of a table and 3D plots.