### SUPER MAGIC OF SOME CONNECTED GRAPHS PN * 2NP6, PN * 2NP7, AND PN * 2NP8

#### Abstract

**:** Krishnappa, Kishore Kothapalli and Venkaiah [2009] analyzed (1)Kn, n odd, admits a vertex magic total labeling; (2) There is a vertex magic total labeling for K** _{n}**, for all n ≡ 2 (mod 4); (3) There is a vertex magic total labeling for K

_{n}, for all n ≡ 4 (mod 8); (4) There is a vertex magic total labeling for K

_{n}, for all n ≡ 0 (mod 8). Subbiaha, and Pandimadevi [2014] found (1)eEvery 2rregular graph has a 2kfactor for every integer k,0 < k < r; (2) An even regular graph G of odd order is not 2-factor E-super magic decomposable, when the number of factors h is even;(3) An even regular graph G of odd order is 2factorEsuper magic decomposable if and only if h is odd, where h is the number of 2factors of G. Selvaraju, Balaganesan, Renuka [2013] made the contributions (1)D

_{2}(P

_{n}) is an even sequential harmonious graph; (2) D

_{2}(K

_{1,n})is an even sequential harmonious graph; Spl(P

_{n})is an even sequential graph;(4) The Spl(K

_{1,n})is an even sequential harmonious graph; (5) Spl(P

_{n})is odd graceful graph; (6) D

_{2}(K

_{1,n})is felicitous graph.

**The aim of the paper**is to find graceful labeling for the graphs P

_{n}*2nP

_{6}, P

_{n}*2nP

_{7}, and P

_{n}*2nP

_{8}.Keywords: Magic graph, super magic graph

#### Full Text:

PDF### Refbacks

- There are currently no refbacks.

This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.

CC BY-SA