• 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 k1, k2 and k3 such that f(x)+f(xy)+f(y) is either k1or k2 or k3, it is said to be an edge trimagic total labeling. In this paper we prove that the ladder Ln (odd n), triangular ladder TLn, generalized Petersen graph P(n, ), the helm graph Hn and the flower graph Fln are edge trimagic total and super edge trimagic total graphs.
Keywords
Full Text:
PDFThis work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
© 2010-2022 International Journal of Mathematical Archive (IJMA) Copyright Agreement & Authorship Responsibility |