Advances in Mathematics: Scientific Journal 9 (2020), no.12, 11127–11132 ADV MATH SCI JOURNAL ISSN: 1857-8365 (printed); 1857-8438 (electronic) https://doi.org/10.37418/amsj.9.12.92 H-E SUPER MAGIC HAMILTON DECOMPOSITION OF GRAPHS J. REMYA1 AND M. SUDHA 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) ! f1; 2; 3; : : : ; p + qg such that P P for every copy H in the decomposition v2V (H) f(v) + e2E(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. 1. INTRODUCTION We consider regular graphs. The vertex and edge sets of a graph G are denoted by V(G) and E(G) respectively. A graph labeling is an assignment of integers to the edges or vertices or both, depend upon certain conditions.E− super magic decomposition of even regular graph have been explained [11]. Also the graph G confesses an (H1;H2;:::;Hn) covering if a covering of G is a family of subgraphs H1;H2;:::;Hn such that every edge of E(G) belongs to at least one of the sub- graphs Hi; 1 ≤ i ≤ n: G confesses an H−covering,if every Hi is isomorphic to a given graph H; A family of subgraphs H1;H2;:::;Hn of G is a H− decomposition of G if all the subgraphs are isomorphic to a graphH; E(Hi)\(Hj) = where i 6= j 1corresponding author 2020 Mathematics Subject Classification. 05C78, 05C70. Key words and phrases. H labeling of graph, H − E Super Magic Hamilton Decomposition, H Decomposition, anti prism graph and Harary graph. 11127 11128 J. REMYA AND M. SUDHA n S and E(G) = E(Hi): In this case, we write G = H1⊕H2⊕· · ·⊕Hn and G is said to i=1 be H−decomposable.Various types of decomposition of graphs have been studied in literature by imposing suitabe conditions on the subgraphs Hi: Geometric de- composition of graphs for various standard graphs have been explained in[9].In this paper we introduce the concept H − E Super Magic Hamilton Decomposi- tion.The graph G is said to be H −E Super Magic Hamilton Decomposition if there exists a mapping f : V (G) [ E(G) ! f1; 2; 3; : : : ; p + qg such that for every copy H P P in the decomposition v2V (H) f(v) + e2E(H) f(e) is constant with each subgraph is hamiltonian. Also f(E(G)) = 1; 2; : : : ; q:If f(V (G)) = 1; 2; : : : ; p then the decom- position is said to be H − V Super Magic Hamilton Decomposition. In 1960 [1] n(n2+1) W.S. Andrews explained about Magic Squares with magic number[MN] 2 for square of n sides.Guterrez and Llado [2] in 2005 first described H−super magic labeling .For basic definition and notation we follow [3]. Hamilton decompostion of complete graph have been proved by Hilton[4]. Inayah et al. [5] studied vari- ous types of labeling along with path decomposition.In 2016 Jude and Swathi [6] studied Hamilton decomposition of Harary graph. In 2012 Marimuthu and Bal- akrishnan [7] proved that if a graph G of odd order can be decomposed into two Hamilton cycles, then G is an E-super vertex magic graph. Petersen [8] studied even regular graph has a 2k−factor. In 2020 Remya and Sudha [10] described star decomposition of graphs with cordial labeling. In this paper we prove that certain regular graphs are decomposed into hamilton cycles with magic constant. Definition 1.1. The anti prism graph An for n ≥ 3 is defined as a 4−regular graph with 2n vertices and 4n edges.It consists of outer and inner Cn, while the two cycles connected by edges viui and viu1+i(modn) for i = 1; 2; 3; : : : ; n: Lemma 1.1. [11] Let G be a m− factor decomposable graph and let g be a bijection from E(G) onto f1; 2; 3; : : : ; qg : Then g can be extended to an m−factor−E−super P 0 magic labeling of G if and only if ke = e2E(G) g(e) is constant for every m-factor G in the decomposition of G: 2. MAIN RESULTS Theorem 2.1. The anti prism graph An is hamiltonian decomposable graph of length 2n with magic constant 4n2 + n, when n ≥ 10 is a positive integer. H − E SUPER MAGIC HAMILTON DECOMPOSITION OF GRAPHS 11129 Proof. Let G = (V; E) be the graph An: The order and size of this graph are 2n and 4n respectively.(ie)jV (G)j = 2n andjE(G)j = 4n:Let fv1; v2; : : : ; vng be the set of vertices of the outer cycle andfu1; u2; : : : ; ung be the set of vertices of the inner cycle.Let fviuig [ viui+1(modn) be the set of edges. Construct a mapping f : E(G) ! f1; 2;:::; 4ng by f(viui) =i; 2 ≤ i ≤ n − 1; f(viui+1) =4n − i; 1 ≤ i ≤ n − 1; f(vivi+1) =2n + i; 1 ≤ i ≤ n − 2; f(uiui+1) =n + i; 1 ≤ i ≤ n − 1; f(v1vn) =4n; f(vnvn−1) =3n; f(u1un) =1; f(u1v1) =2n; f(unvn) =3n − 1; f (u1vn) =n: The Hamilton decomposition of antiprism graph of length 2n are fv1u2; u2v2; v2u3; u3v3; v3u4; u4v4; v4u5; : : : ; vn−1un; unu1; u1vn; vnv1g ; fv1v2; v2v3; v3v4; v4v5; v5v6; : : : ; vn−1vn; vnun; unun−1; : : : ; u2u1; u1v1g and X f(e) = [1 + 2 + 3 + ··· + n] + [(4n − 1) + (4n − 2) + (4n − 3) + ··· e2E(H1) + (4n − (n − 1))] + 4n = 4n2 + n: Also P f(e) = 4n2 + n: e2E(H2) Theorem 2.2. If k; n are positive integer such that n > k, then Harary graph Hk;n kn2+2n have a hamiltonian decomposition graph of length n with magic constant 4 . Proof. Let G = (V; E) be the graph Hk;n: The order and size of this graph are n kn and 2 , respectively. G can be decomposed into Hamiltonian cycles say H1 ⊕ H2 ⊕ k H3 ⊕ ::: ⊕ H k each cycles of length n. Put k = r. Procedure for Hamilton 2 2 Decomposition of Hk;n is done by [6]. Case (i) When r and n are positive even integers. The edge of the graph can be labeled as shown in Table 1. 11130 J. REMYA AND M. SUDHA TABLE 1. The edge label of Hk;n if r and n are positive even integers. H1 H2 H3 ::: H k H k 2 −1 2 k k 1 2 3 ... 2 − 1 2 k k k k − 1 k − 2 ... 2 + 2 2 + 1 3k 3k k + 1 k + 2 k + 3 ... 2 − 1 2 3k 3k 2k 2k − 1 2k − 2 ... 2 + 2 2 + 1 . k k k k k 2 (n − 2) 2 (n − 2) − 1 2 (n − 2) − 2 ... 2 (n − 3) + 2 2 (n − 3) + 1 k k k k k 2 (n − 2) + 1 2 (n − 2) + 2 2 (n − 2) + 3 ... 2 (n − 1) − 1 2 (n − 1) kn kn kn k k 2 2 − 1 2 − 2 ... 2 (n − 1) + 2 2 (n − 1) + 1 The sum of the edge labels for the Hamiltonian cycles are X k k kn f(e) = 1 + k + k + 1 + 2k + ··· + (n − 2) + (n − 2) + 1 + 2 2 2 e2E(H1) kn2 + 2n = : 4 In similar way ,we calculate the magic constant for each decomposition H2;H3;H4; kn2+2n :::;H k as : 2 4 Case (ii) When r is even and n is an odd integer with r 6≡ 0(mod4).The edge of the graph can be labeled as shown in Table 2. TABLE 2. The edge label of Hk;n if r is even and n is an odd integer with r 6≡ 0(mod4). H1 H2 H3 ::: Hk=2−1 Hk=2 k k 2 × 2 k2 k2 k2 k2 k k2 k 4 + 1 4 + 2 4 + 3 ... 4 + 2 − 1 4 + 2 k2 k2 k2 k2 k k2 k 4 + k 4 + k − 1 4 + k − 2 ... 4 + 2 + 2 4 + 2 + 1 k2 k2 k2 k2 3k k2 3k 4 + k + 1 4 + k + 2 4 + k + 3 ... 4 + 2 − 1 4 + 2 . k2 k k k2 k k k2 k k k2 k k k2 k k 4 + (n − 2 − 2) 2 + 1 4 + (n − 2 − 2) 2 + 2 4 + (n − 2 − 2) 2 + 3 ... 4 + (n − 2 − 1) 2 − 1 4 + (n − 2 − 1) 2 k2 k k k2 k k k2 k k k2 k k k2 k k 4 + n − 2 2 4 + n − 2 2 − 1 4 + n − 2 2 − 2 ... 4 + n − 2 − 1 2 + 2 4 + n − 2 − 1 2 + 1 H − E SUPER MAGIC HAMILTON DECOMPOSITION OF GRAPHS 11131 The sum of the edge labels for the Hamiltonian cycles are X k2 k2 k2 k2 f(e) = MN + + 1 + + k + + k + 1 + ::: + 4 4 4 4 e2E(H1) k k k2 k k + (n − − 2) + 1 + + (n − ) 2 2 4 2 2 " # k3 k k2n k3 2n−k−4 2n−k−4+4 = + + − + 2k 4 4 16 4 4 8 2 2n − k nk k2 kn2 + 2n + + − = 4 2 4 4 In similar way, we calculate the magic constant for each decomposition H2;H3;H4; kn2+2n :::;H k as : 2 4 REFERENCES [1] W.