KADIKMA
Vol 6 No 1 (2015): April 2015

SUPER (a,d)-EDGE ANTIMAGIC TOTAL LABELING OF CONNECTED LAMPION GRAPH

Robiatul Adawiyah (Unknown)
D Dafik (Unknown)
S Slamin (Unknown)



Article Info

Publish Date
01 Apr 2015

Abstract

Abstract. A G graph of order p and size q is called an (a,d)-edge antimagic total if there exist a bijection f: V(G)E(G) {1,2,…,p+q} such that the edge-weights, w(uv)=f(u)+f(v)+f(uv), uv E(G), form an arithmetic sequence with first term a and common difference d. Such a graph G is called super if the smallest possible labels appear on the vertices. In this paper we study super (a,d)-edge-antimagic total properties of connected £n,m by using deductive axiomatic and the pattern recognition method. The result shows that a connected Lampion graphs admit a super (a,d)-edge antimagic total  labeling for d = 0,1,2 for n It can be concluded that the result of this research has covered all the feasible d. Key Words: (a,d)-edge antimagic vertex labeling, super (a,d)-edge antimagic total labeling, Lampion Graph.  

Copyrights © 2015






Journal Info

Abbrev

kadikma

Publisher

Subject

Mathematics

Description

KadikmA (p-ISSN: 2085-0662 dan e-ISSN: 2686-3243) adalah jurnal nasional bidang Matematika dan Pendidikan Matematika yang diterbitkan oleh Program Studi Pendidikan Matematika, FKIP, Universitas Jember. Kadikma terbit 3 kali dalam setahun pada bulan April, Agustus dan Desember. Jurnal Matematika dan ...