• MORE RESULTS ON EDGE TRIMAGIC LABELING OF GRAPHS

Abstract

An edge magic total labeling of a (p, q) graph is a bijection f: V(G) È E(G) ® {1, 2, …, p+q} such that FOR each edge xyÎE(G), the value of f(x)+f(xy)+f(y) is a constant k. If there exists three constants k₁, k₂ and k₃ such that f(x)+f(xy)+f(y) is either k₁or k₂ or k₃, it is said to be an edge trimagic total labeling. In this paper we prove that the ladder L_n (odd n), triangular ladder TL_n, generalized Petersen graph P(n, ), the helm graph H_n and the flower graph Fl_n are edge trimagic total and super edge trimagic total graphs.