H – E Super Magic Hamilton Decomposition of Graphs

Abstract

A Hamilton decomposition of G is a partition of its edge set into dis joint Hamilton cycles. A Hamilton cycle in a graph G is a cycle passing through every vertex of G.The graph G is said to be H −E Super Magic Hamilton Decom position if there exists a mapping f : V (G)∪E(G) → {1,2,3,...,p + q} such that for every copy H in the decomposition v∈V(H)f(v) + e∈E(H)f(e) is constant with each subgraph is hamiltonian. Also f(E(G)) = 1,2,...,q. In this paper we prove that the anti prism graph An and Harary graph Hk,n are H−E Super Magic Hamilton decomposable graph