An Overview: Progressive Report on Magic Labelling

If there is a bijective function f : V(G) ∪ E(G) → {1, 2, .. …|V(G)| + |E(G)|} that holds true for all of the edges uv in a graph G = (V,E), then it is said to be magical. Super magic is the term used to describe an edge-magic graph if f(V(G)) = {1, 2, .. …p}. The magic strength of a magic graph G is the minimum of all constants, let’s say m(G), where the minimum is calculated over all such bijections. In this study, magic strength is examined and classes of super edge-magic graphs are explained.