CK-E-Super Magic Graceful Labeling of Some Families of Graphs

If each interfere E(G) of a subgraph of G is isomorphic to H, the graph G has an H-covering. A bijection f: V(G) UE(G) → {1, 2,…,p+q} is H – E-excellent magic charming labeling (H-E- SMGL) with the possessions f(E(G)) = {1, 2,…, q} and for each subgraph H’ of G isomorphic to H, Σv=V(H’) f(v) – ΣeeE(H) f(e) = M for few positive integer M.Applying the definition of H-E-SMGL, in this place article we study C-E-excellent magic labeling of few families of graphs to a degree generalized fan graph and inference of a graph achieved at connecting of a star K1, with individual isolated top.

Author(s) Details:

M. Sindhu,
Excel Engineering College (Autonomous), Namakkal-637303, Tamil Nadu, India.

S. Chandra Kumar,
Department of Mathematics, Scott Christian College (Autonomous), Nagercoil- 629003, Tamil Nadu, India.

Please see the link here: https://stm.bookpi.org/RATMCS-V1/article/view/10687

Keywords: H-covering, H-E-SM labeling, H-E-SMGL